Pages that link to "Item:Q2931386"
From MaRDI portal
The following pages link to New approximation guarantee for chromatic number (Q2931386):
Displayed 20 items.
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- On the tractability of coloring semirandom graphs (Q975431) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Hypercontractive inequalities via SOS, and the Frankl--Rödl graph (Q2826231) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← 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)
- (Q5092401) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
- (Q5743408) (← links)
- (Q5870293) (← links)
- (Q5875482) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)