Pages that link to "Item:Q4305670"
From MaRDI portal
The following pages link to New approximation algorithms for graph coloring (Q4305670):
Displaying 40 items.
- An approximate algorithm for the chromatic number of graphs (Q283679) (← links)
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- Report 7/2006: Algorithmic Graph Theory (February 12th -- February 18th, 2006) (Q873854) (← links)
- A better performance guarantee for approximate graph coloring (Q911757) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- Approximation results for the minimum graph coloring problem (Q1321829) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- Polynomial approximation and graph-coloring (Q1404543) (← links)
- Improving graph colouring algorithms and heuristics using a novel representation (Q1742608) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs (Q2768313) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← 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)
- Improved inapproximability results for maximum \(k\)-colorable subgraph (Q3191580) (← links)
- Improving the performance guarantee for approximate graph coloring (Q3763600) (← links)
- (Q4533083) (← links)
- Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers (Q4651517) (← links)
- Algorithms for coloring semi-random graphs (Q4705329) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- (Q5092401) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
- New Algorithm for Chromatic Number of Graphs and their Applications (Q5220289) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- (Q5870293) (← links)
- (Q5875482) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)
