Pages that link to "Item:Q2931386"
From MaRDI portal
The following pages link to New approximation guarantee for chromatic number (Q2931386):
Displayed 6 items.
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- On the tractability of coloring semirandom graphs (Q975431) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)