A better performance guarantee for approximate graph coloring-Reference-Cited by-同舟云学术

A better performance guarantee for approximate graph coloring

Published:1990-06 Issue:1-4 Volume:5 Page:459-466
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Berger Bonnie,Rompel John

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01840398.pdf

Reference5 articles.

1. Garey, M. R., and Johnson, D. S., The complexity of near-optimal graph coloring,J. Assoc. Comput. Mach.,23 (1976), 43–49.

2. Johnson, D. S., Worst-case behavior of graph-coloring algorithms,Proc. 5th South-Eastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, 1974, pp. 513–528.

3. Linial, N., Saks, M., and Wigderson, A., personal communication.

4. Raghavan, P., personal communication.

5. Wigderson, A., Improving the performance guarantee of approximate graph coloring,J. Assoc. Comput. Mach.,30 (1983), 729–735.

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

1. Better Coloring of 3-Colorable Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Robust Factorizations and Colorings of Tensor Graphs;SIAM Journal on Discrete Mathematics;2024-02-28

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

4. Coloring 3-Colorable Graphs with Less than n 1/5 Colors;Journal of the ACM;2017-03-29

5. Some Recent Progress for Approximation Algorithms;Principles and Methods of Quantum Information Technologies;2016