A theorem on the approximation of set cover and vertex cover

  • V. Th. Paschos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 560)


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.


Approximation Algorithm Bipartite Graph Approximation Ratio Vertex Cover Characteristic Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.Google Scholar
  2. [2]
    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
  3. [3]
    C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, New Jersey, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • V. Th. Paschos
    • 1
    • 2
  1. 1.LRIUniversité de Paris XIOrsay Cedex
  2. 2.CERMSEMUniversité de Paris I-SorbonneParis

Personalised recommendations