A theorem on the approximation of set cover and vertex cover
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.
KeywordsApproximation Algorithm Bipartite Graph Approximation Ratio Vertex Cover Characteristic Graph
Unable to display preview. Download preview PDF.
- C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.Google Scholar
- 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.Google Scholar
- C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, New Jersey, 1981.Google Scholar