Approximating k-set cover and complementary graph coloring
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 118-131
- https://doi.org/10.1007/3-540-61310-2_10
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Maximizing the number of unused colors in the vertex coloring problemInformation Processing Letters, 1994
- Approximation results for the minimum graph coloring problemInformation Processing Letters, 1994
- A modified greedy heuristic for the Set Covering problem with improved worst case boundInformation Processing Letters, 1993
- 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 ProblemsSIAM Journal on Discrete Mathematics, 1989
- Graph TheoryPublished by Springer Nature ,1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975