New approximation algorithms for graph coloring

Author:

Blum Avrim1

Affiliation:

1. Massachusetts Institute of Technology, Cambridge

Abstract

The problem of coloring a graph with the minimum number of colors is well known to be NP-hard, even restricted to k -colorable graphs for constant k ≥ 3. This paper explores the approximation problem of coloring k -colorable graphs with as few additional colors as possible in polynomial time, with special focus on the case of k = 3. The previous best upper bound on the number of colors needed for coloring 3-colorable n -vertex graphs in polynomial time was O(√n / √log n colors by Berger and Rompel, improving a bound of O(√n) colors by Wigderson. This paper presents an algorithm to color any 3-colorable graph with O(n 3/8 polylog( n )) colors, thus breaking an “ O((n 1/2-o(1) ) barrier”. The algorithm given here is based on examining second-order neighborhoods of vertices, rather than just immediate neighborhoods of vertices as in previous approaches. We extend our results to improve the worst-case bounds for coloring k -colorable graphs for constant k > 3 as well.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference20 articles.

1. Fast probabilistic algorithms for Hamiltonian circuits ~and matchings;~ANGLUIN D.;J. Comput. Syst. Sci.,1979

2. A local-ratio theorem for approximating the weighted ~vertex cover problem;~BAR-YEHUDA R.;Ann. Dis. Math.,1985

3. ~BERGE C. 1973. Graphs and H)jDergraphs. North-Holland Amsterdam The Netherlands. ~BERGE C. 1973. Graphs and H)jDergraphs. North-Holland Amsterdam The Netherlands.

4. A better performance guarantee for approximate graph ~coloring;~BERGER B.;Algonthmica,1990

Cited by 65 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. CLAP: A New Algorithm for Promise CSPs;SIAM Journal on Computing;2023-01-25

2. One stride ahead Advancements in Dispersed Graph Coloring;2023 International Conference for Advancement in Technology (ICONAT);2023-01-24

3. Linearly Ordered Colourings of Hypergraphs;ACM Transactions on Computation Theory;2022-12-31

4. Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

5. Throughput Maximization of UAV Networks;IEEE/ACM Transactions on Networking;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3