Skip to main content
SpringerLink
Log in

Some further approximation algorithms for the vertex cover problem

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP'83 (CAAP 1983)

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

Included in the following conference series:

Abstract

In this paper we describe an approximation algorihm for the vertex cover problem which has a worst case ratio Δ strictly smaller than 2 for graphs which don't have too many nodes (for example Δ≤1.9 if |V|≤1o13). Furthermore we present algorithms which improve in the case of degree bounded graphs the worst case ratios known up to now.

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. R. Bar-Yehuda and S. Even: A linear-time approximation algorithm for the weighted vertex cover problem, J. Algorithms 2 (1982), 198–203

    Article  Google Scholar 

  2. R. Bar-Yehuda and S. Even: On Approximating a Vertex Cover for Planar Graphs, Proc. 14th Annual ACM Symposium on Theory of Comuting (1982), 303–309

    Google Scholar 

  3. P. Erdös and T. Gallai: ON THE MINIMAL NUMBER OF VERTICES REPRESENTING THE EDGES OF A GRAPH, MAGYAR TUDOMÁNYOS AKADÉMIA MATEMATIKAI KUTATO INTÉZETÉNEK KÖZLEMÉNYEI VI. EVFOLYAM 1961, 181–203

    Google Scholar 

  4. S. Fajtlowicz: On the size of independent sets in graphs, Proc. 9th S.E. Conf. Combinatorics, Graph Theory and Computing (1978), 269–274

    Google Scholar 

  5. D. Hochbaum: Efficient Bounds for the Stable Set, Vertex Cover and Set Packing Problems, W.P. # 50-80-81, GSIA, Carnegie-Mellon University, May 1981

    Google Scholar 

  6. G. Hopkins and W. Staton: Girth and Independence Ratio, Canad. Math. Bull. 25 (1982), 179–186

    Google Scholar 

  7. J.E. Hopcroft and R.M. Karp: An n5/2 Algorithm for Maximal Matchings in Bipartite graphs, SIAM J. Comput. 4 (1973), 225–231

    Article  Google Scholar 

  8. D. König: Theorie der endlichen und unendlichen Graphen, Leipzig, 1936

    Google Scholar 

  9. B. Monien: The Complexity of Determining a Shortest Cycle of even Length, Proc. Workshop "Graphtheoretic Concepts in Computer Science, Hanser Verlag, 1982

    Google Scholar 

  10. G.L. Nemhauser and L.E. Trotter: Vertex Packings: Structural Properties and Algorithms, Mathematical Programming 8 (1975), 232–248

    Article  Google Scholar 

  11. E. Speckenmeyer: Covering all circuits in undirected graphs of degree 3 by a minimal number of vertices, Technical Report, Universität Paderborn, 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Paderborn, Germany

    B. Monien & E. Speckenmeyer

Authors
  1. B. Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Speckenmeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Speckenmeyer, E. (1983). Some further approximation algorithms for the vertex cover problem. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

  • Online ISBN: 978-3-540-38714-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation