Abstract
An approximation result is given, connecting two well known combinatorial problems, the Set Cover and the Vertex Cover. This result constitutes an improvement of the existing ratio for the latter, on a large and intuitive class of graphs, provided that an approximation algorithm exists for the former.
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.
R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Fransisco, 1979.
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, New Jersey, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paschos, V.T. (1991). A theorem on the approximation of set cover and vertex cover. In: Biswas, S., Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1991. Lecture Notes in Computer Science, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54967-6_75
Download citation
DOI: https://doi.org/10.1007/3-540-54967-6_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54967-3
Online ISBN: 978-3-540-46612-3
eBook Packages: Springer Book Archive