# 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} }

- Published in Inf. Sci. 1999
DOI:10.1016/S0020-0255(98)10058-0

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

#### Citations

##### Publications citing this paper.

SHOWING 1-6 OF 6 CITATIONS

## Cost-effectiveness of algorithms

VIEW 4 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## The maximum saving partition problem

VIEW 4 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Themaximumsaving partition problem

VIEW 4 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Differential approximation ∗

VIEW 1 EXCERPT

CITES BACKGROUND

## Differential approximation ( septembre 2005 )

VIEW 1 EXCERPT

CITES BACKGROUND

## CAHIER DU LAMSADE 228 Septembre 2005 Differential approximation

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 12 REFERENCES

## Approximation Results for the Minimum Graph Coloring Problem

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Yanakakis, On the hardness of approximating minimization problems

## Yanakakis, On the hardness of approximating minimization problems

## Some tools for approximate 3-coloring

VIEW 2 EXCERPTS

## Improving the performance guarantee for approximate graph coloring

#### Similar Papers

Loading similar papers…