Pages that link to "Item:Q2760093"
From MaRDI portal
The following pages link to Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation (Q2760093):
Displaying 11 items.
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← links)
- Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment. (Q2773169) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897211) (← links)
