Three-Quarter Approximation for the Number of Unused Colors in Graph Coloring

@article{Tzeng1999ThreeQuarterAF,
  title={Three-Quarter Approximation for the Number of Unused Colors in Graph Coloring},
  author={Wen-Guey Tzeng and Gow-Hsing King},
  journal={Inf. Sci.},
  year={1999},
  volume={114},
  pages={105-126}
}
The graph coloring problem is to color vertices of a graph so that no adjacent vertices are of the same color. The problem is difficult not only in finding the optimal solution, but also in approximation. Since it is hard to approximate the minimum number of colors, we consider to approximate the maximum number of unused colors. This approximation is based on saving colors with respect to the most naive coloring method, which colors each vertex with a different color. In this paper we propose a… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS

Cost-effectiveness of algorithms

  • Discrete Mathematics & Theoretical Computer Science
  • 2015
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The maximum saving partition problem

  • Oper. Res. Lett.
  • 2005
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Themaximumsaving partition problem

Refael Hassina, Jérôme Monnotb
  • 2004
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Differential approximation ∗

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

Yanakakis, On the hardness of approximating minimization problems

M. C. Lund
  • in: Proc. 25th Annual ACM Symp. Theory of Computing,
  • 1993

Yanakakis, On the hardness of approximating minimization problems

M. C. Lund
  • in: Proc. 25th Annual ACM Symp. Theory of Computing,
  • 1993

Some tools for approximate 3-coloring

  • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
VIEW 2 EXCERPTS

Improving the performance guarantee for approximate graph coloring

A. Widgerson
  • J. ACM
  • 1983

Similar Papers

Loading similar papers…