skip to main content
10.1145/1132516.1132548acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

New approximation guarantee for chromatic number

Published: 21 May 2006 Publication History

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.

References

[1]
S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings, and graph partitioning. In Proc. of 36th Annual ACM Symposium on Theory of Computing (STOC), pages 222--231, 2004.
[2]
A. Blum. New approximations for graph coloring. Journal of the ACM, 41(3):470--516, 1994.
[3]
A. Blum and D. Karger. An Õ(n3/14)-coloring algorithm for 3-colorable graphs. Information Processing Letters, 61(1):49--53, 1997.
[4]
C. Borell. The Brunn-Minkowski inequality in gauss space. Invent. Math., 30:207--216, 1975.
[5]
S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In IEEE Conference on Computational Complexity, pages 144--153, 2005.
[6]
I. Dinur, E. Mossel, and O. Regev. Conditional hardness for approximate coloring. In Proc. of 38th Annual ACM Symposium on Theory of Computing (STOC), 2006.
[7]
U. Feige, M. Langberg, and G. Schechtman. Graphs with tiny vector chromatic numbers and huge chromatic numbers. SIAM J. Computing, 33(6):1338--1368, 2004.
[8]
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115--1145, 1995.
[9]
J. Hastad. Clique is hard to approximate within n1-ε. Acta Math., 182:105--142, 1999.
[10]
J. Hastad. Some optimal inapproximability results. Journal of the ACM, 48(4):798--859, 2001.
[11]
D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM, 45(2):246--265, 1998.
[12]
H. Karloff and U. Zwick. A 7/8-approximation algorithm for max 3SAT? In Proc. of 38th IEEE FOCS, pages 406--415, 1997.
[13]
S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for max-cut and other 2-variable CSPs? In Proc. of 45th IEEE FOCS, pages 146--154, 2004.
[14]
S. Khot and N. Vishnoi. Metrics, cuts, and unique games. In Proc. of 46th IEEE FOCS, pages 53--62, 2005.
[15]
T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787--832, 1999.
[16]
V. Sudakov and B. Tsirel'son. Extremal properties of half-spaces for spherically invariant measures. Soviet Math, 9:9--18, 1978. Translated from Zap. Nauch. Sem. L.O.M.I 41:14--24, 1964
[17]
A. Wigderson. Improving the performance guarantee of approximate graph coloring. Journal of the ACM, 30(4):729--735, 1983.

Cited By

View all
  • (2024)Collaborative learning with different labeling functionsProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692488(10530-10552)Online publication date: 21-Jul-2024
  • (2023)One stride ahead Advancements in Dispersed Graph Coloring2023 International Conference for Advancement in Technology (ICONAT)10.1109/ICONAT57137.2023.10080064(1-3)Online publication date: 24-Jan-2023
  • (2022)Tolerant Testers of Image PropertiesACM Transactions on Algorithms10.1145/353152718:4(1-39)Online publication date: 10-Oct-2022
  • Show More Cited By

Index Terms

  1. New approximation guarantee for chromatic number

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
    May 2006
    786 pages
    ISBN:1595931341
    DOI:10.1145/1132516
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 May 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. approximation algorithms
    2. chromatic number
    3. graph coloring
    4. semidefinite programming

    Qualifiers

    • Article

    Conference

    STOC06
    Sponsor:
    STOC06: Symposium on Theory of Computing
    May 21 - 23, 2006
    WA, Seattle, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)16
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Collaborative learning with different labeling functionsProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692488(10530-10552)Online publication date: 21-Jul-2024
    • (2023)One stride ahead Advancements in Dispersed Graph Coloring2023 International Conference for Advancement in Technology (ICONAT)10.1109/ICONAT57137.2023.10080064(1-3)Online publication date: 24-Jan-2023
    • (2022)Tolerant Testers of Image PropertiesACM Transactions on Algorithms10.1145/353152718:4(1-39)Online publication date: 10-Oct-2022
    • (2022)Analyzing the Impact of COVID-19 Control Policies on Campus Occupancy and Mobility via WiFi SensingACM Transactions on Spatial Algorithms and Systems10.1145/35165248:3(1-26)Online publication date: 22-Sep-2022
    • (2022)Software/Hardware Co-design of 3D NoC-based GPU Architectures for Accelerated Graph ComputationsACM Transactions on Design Automation of Electronic Systems10.1145/351435427:6(1-22)Online publication date: 27-Jun-2022
    • (2022)Quantum Circuit Transformation: A Monte Carlo Tree Search FrameworkACM Transactions on Design Automation of Electronic Systems10.1145/351423927:6(1-27)Online publication date: 27-Jun-2022
    • (2022)Toward a Human-Readable State Machine ExtractionACM Transactions on Design Automation of Electronic Systems10.1145/351308627:6(1-31)Online publication date: 27-Jun-2022
    • (2022)Breaking the Design and Security Trade-off of Look-up-table–based ObfuscationACM Transactions on Design Automation of Electronic Systems10.1145/351042127:6(1-29)Online publication date: 27-Jun-2022
    • (2022)Increasing the Fault Coverage of a Truncated Test SetACM Transactions on Design Automation of Electronic Systems10.1145/350845927:6(1-16)Online publication date: 27-Jun-2022
    • (2022)Detecting Feedback Vertex Sets of Size k in O⋆ (2.7k) TimeACM Transactions on Algorithms10.1145/350402718:4(1-26)Online publication date: 10-Oct-2022
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media