New approximation guarantee for chromatic number

Authors:
Sanjeev Arora;Eden Chlamtac
Affiliations:
Princeton University, Princeton, NJ;Princeton University, Princeton, NJ
Venue:
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Year:
2006

Citing 14
Cited 12

Improving the performance guarantee for approximate graph coloring

Journal of the ACM (JACM)
New approximation algorithms for graph coloring

Journal of the ACM (JACM)
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
An Õ(n3/14)-coloring algorithm for 3-colorable graphs

Information Processing Letters
Approximate graph coloring by semidefinite programming

Journal of the ACM (JACM)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
Some optimal inapproximability results

Journal of the ACM (JACM)
A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers

SIAM Journal on Computing
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the Hardness of Approximating Multicut and Sparsest-Cut

CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Conditional hardness for approximate coloring

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Balanced max 2-sat might not be the hardest

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the tractability of coloring semirandom graphs

Information Processing Letters
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Additive approximation algorithms for list-coloring minor-closed class of graphs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Hadwiger's conjecture is decidable

Proceedings of the forty-first annual ACM symposium on Theory of computing
On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Towards Sharp Inapproximability for Any 2-CSP

SIAM Journal on Computing
Distributed coloring depending on the chromatic number or the neighborhood growth

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
New tools for graph coloring

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Linear index coding via semidefinite programming

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Recognizing 3-colorings cycle-patterns on graphs

Pattern Recognition Letters
Symmetry breaking depending on the chromatic number or the neighborhood growth

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe how to color every 3-colorable graph with O(n0.2111) colors, thus improving an algorithm of Blum and Karger from almost a decade ago. Our analysis uses new geometric ideas inspired by the recent work of Arora, Rao, and Vazirani on SPARSEST CUT, and these ideas show promise of leading to further improvements.