Skip to main content
SpringerLink
Log in

A theorem on the approximation of set cover and vertex cover

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 560))

  • 156 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.

    Google Scholar 

  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. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, New Jersey, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRI, Université de Paris XI, Bât. 490, 91405, Orsay Cedex

    V. Th. Paschos

  2. CERMSEM, Université de Paris I-Sorbonne, 12 place du Panthéon, 75005, Paris

    V. Th. Paschos

Authors
  1. V. Th. Paschos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Somenath Biswas Kesav V. Nori

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation