Abstract
We consider instances of the Set Cover problem where each set is of small size. For collections of sets of size at most three, we obtain improved performance ratios of 1.4 + ε, for any constant ε > 0. Similar improvements hold also for collections of larger sets. A corollary of this result is an improved performance ratio of 4/3 for the problem of minimizing the unused colors in a graph coloring.
Work done in part at Japan Advanced Institute of Science and Technology — Hokuriku, Japan.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. In Proc. Fifth Ann, ACM-SIAM Symp. on Discrete Algorithms, pages 365–371, Jan. 1994.
B. Bollobás. Extremal Graph Theory. Academic Press, 1978.
P. Crescenzi and V. Kann. A compendium of NP optimization problems. Dynamic on-line survey available at nada.kth.se, 1995.
M. Demange, P. Grisoni, and V. T. Paschos. Approximation results for the minimum graph coloring problem. Inform. Process. Lett., 50:19–23, 1994.
O. Goldschmidt, D. S. Hochbaum, and G. Yu. A modified greedy heuristic for the set covering problem with improved worst case bound. Inform. Process. Lett., 48:305–310, 1993.
M. M. Halldórsson. Approximating discrete collections via local improvements. In Proc. Sixth ACM-SIAM Symp. on Discrete Algorithms, pages 160–169, Jan. 1995.
R. Hassin and S. Lahav. Maximizing the number of unused colors in the vertex coloring problem. Inform. Process. Lett, 52:87–90, 1994.
C. A. J. Hurkens and A. Schrijver. On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Disc. Math., 2(1):68–72, Feb. 1989.
D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9:256–278, 1974.
L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Math., 13:383–390, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M.M. (1996). Approximating k-set cover and complementary graph coloring. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61310-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-61310-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61310-7
Online ISBN: 978-3-540-68453-4
eBook Packages: Springer Book Archive