34 citations · 62 across the 8 of their papers we have counts for
10 papers
Practical Experience with Stable Set and Coloring Relaxations
Dunja Pucher, Franz Rendl
The stable set problem and the graph coloring problem are classes of NP-hard optimization problems on graphs. It is well known that even near-optimal solutions for these problems a…
Stable-Set and Coloring bounds based on 0-1 quadratic optimization
Dunja Pucher, Franz Rendl
We consider semidefinite relaxations of Stable-Set and Coloring, which are based on quadratic 0-1 optimization. Information about the stability number and the chromatic number is h…
A Computational Study of Exact Subgraph Based SDP Bounds for Max-Cut, Stable Set and Coloring
Elisabeth Gaar, Franz Rendl
The "exact subgraph" approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization…
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
Michael Juenger, Elisabeth Lobe, Petra Mutzel +4
Quantum annealing is getting increasing attention in combinatorial optimization. The quantum processing unit by D-Wave is constructed to approximately solve Ising models on so-call…
Lower Bounds for the Bandwidth Problem
Franz Rendl, Renata Sotirov, Christian Truden
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the…
A Bundle Approach for SDPs with Exact Subgraph Constraints
Elisabeth Gaar, Franz Rendl
The 'exact subgraph' approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization…