Skip to main content
SpringerLink
Log in

An approximation of the minimum vertex cover in a graph

  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

Abstract

For a given undirected graphG withn vertices andm edges, we present an approximation algorithm for the minimum vertex cover problem. Our algorithm finds a vertex cover within\(2 - \frac{{8m}}{{13n^2 + 8m}}\) of the optimal size inO(nm) time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B.S. Baker, Approximation algorithm for NP-complete problems on planar graphs. J. ACM,41 (1994), 153–180.

    Article  MATH  Google Scholar 

  2. R. Bar-Yehuda and S. Even, A local-ration theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics,25 (1985), 27–45.

    MathSciNet  Google Scholar 

  3. P. Berman and M. Fürer, Approximating maximum independent set in bounded degree graphs. Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, 365–371.

  4. A.E.F. Clementi and L. Trevisan, Improved non-approximability results for vertex cover with density constraints. Lecture Notes in Computer Science,1090, 2nd Conf. on Computing and Combinatorics, 1996, 333–342.

    Google Scholar 

  5. M.R. Garey and D.S. Johnson, Computers an Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.

    Google Scholar 

  6. B. Monien and E. Speckenmeyer, Some further approximation algorithms for the vertex cover problem. Proc. CAAP ’83, Lecture Notes in Computer Science,159, Springer-Verlag, 1983, 341–349.

  7. J. Håstad, Some optimal inapproximability results. Proc. 29th ACM Symp. on Theory of Computing, 1997, 1–10.

  8. M.M. Halldórsson and J. Radhakrishnan, Improved approximations of independent sets in bounded-degree graphs. Lecture Notes in Computer Science,824, 4th Scand. Workshop on Algorithm Theory, 1994, 195–206.

    Google Scholar 

  9. J.E. Hopcroft and R.M. Karp, Ann 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput.,2 (1973), 225–231.

    Article  MATH  MathSciNet  Google Scholar 

  10. R.M. Karp, Reducibility among combinatorial problems. Complexity of Computer Computations (eds. R.E. Miller and J.W. Thatcher),Plenum Press, New York, 1972, 85–103.

    Google Scholar 

  11. M. Karpinski and A. Zelikovsky, Approximating dense cases of covering problems. Proc. DIMACS Workshop on Network Design: Connectivity and Facilities Location 1997 169–178.

  12. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes. J. Comput. System Sci.,43 (1991), 425–440.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics, Kyoto University, 606-8501, Kyoto, Japan

    Hiroshi Nagamochi & Toshihide Ibaraki

Authors
  1. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hiroshi Nagamochi.

About this article

Cite this article

Nagamochi, H., Ibaraki, T. An approximation of the minimum vertex cover in a graph. Japan J. Indust. Appl. Math. 16, 369–375 (1999). https://doi.org/10.1007/BF03167363

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03167363

Key words

Search

Navigation