Skip to main content
SpringerLink
Log in

Vertex Cover Problem—Revised Approximation Algorithm

  • Conference paper
  • First Online:
Artificial Intelligence and Evolutionary Algorithms in Engineering Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 324))

Abstract

This paper is aimed to present the solution to vertex cover problem by means of an approximation solution. As it is NP complete problem, we can have an approximate time algorithm to solve the vertex cover problem. We will modify the algorithm to have an algorithm which can be solved in polynomial time and which will give near to optimum solution. It is a simple algorithm which will be based on articulation point. Articulation point can be found using the Depth First Search algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. M. Garry, D. Johnson, Computers and Intractability: A User Guide to the Theory of NP Completeness (San Francisco, 1979)

    Google Scholar 

  2. P.S. Oliveto, X. Yao, J. He, Analysis of Population-based Evolutionary Algorithms for the Vertex Cover Problem (IEEE, 2008), pp. 1563–1570

    Google Scholar 

  3. L. Ding, B. Gu, X. Hong, B. Dixon, Articulation node based routing in delay tolerant networks, in IEEE International Conference (2009), pp. 1–6

    Google Scholar 

  4. Y. Zeng, D. Wang, W. Liu, A. Xiong, An approximation algorithm for weak vertex cover problem in IP network traffic measurement, IEEE International Conference (2009), pp. 182–186

    Google Scholar 

  5. J. Chen, I.A. Kanj, G. Xia, Improved parameterized upper bounds for vertex cover. 31st International Conference on Mathematical Foundations of Computer Science (2006)

    Google Scholar 

  6. F. Delbot, C. Laforest, A better list heuristic for vertex cover. Inf. Process. Lett. 107, 125–127 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. E. Angel, R. Campigotto, C. Laforest, Algorithm for the vertex cover problem on large graphs. IBISC Research report (2010)

    Google Scholar 

  8. R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25, 27–46 (1985)

    MathSciNet  Google Scholar 

  9. G.L. Nemhauser, L.E. Trotter, Vertex packing: structural properties and algorithms. Math. Program. 8, 232–248 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  10. E. Asgeirsson, C. Stein, Vertex Cover Approximations on Random Graphs (Springer, Berlin, 2007), pp. 285–296

    Google Scholar 

  11. P. Erdos, A. Renyi, On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)

    MathSciNet  Google Scholar 

  12. F. Kuhn, M. Mastrolilli, Vertex cover in graphs with locally few colors (2011), pp 498–509

    Google Scholar 

  13. D. Hochbaum, Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555–556 (1982)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgment

We would like to thank the School of Computer Science and Engineering, VIT University, for giving us such an opportunity to carry out this research work and also for providing us the requisite resources and infrastructure for carrying out the research.

Author information

Authors and Affiliations

  1. School of Computing Science and Engineering, VIT University, Vellore, 632014, India

    Kartik Shah, Praveenkumar Reddy & R. Selvakumar

Authors
  1. Kartik Shah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Praveenkumar Reddy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Selvakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kartik Shah .

Editor information

Editors and Affiliations

  1. Electrical & Electronics Engineering, Noorul Islam Centre for Higher Education, Kumaracoil, Tamil Nadu, India

    L. Padma Suresh

  2. Electrical and Electronics Engineering, SRM Engineering College, Kattankulathur, Tamil Nadu, India

    Subhransu Sekhar Dash

  3. Electrical Engineering, IIT Delhi, New Delhi, Delhi, India

    Bijaya Ketan Panigrahi

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Shah, K., Reddy, P., Selvakumar, R. (2015). Vertex Cover Problem—Revised Approximation Algorithm. In: Suresh, L., Dash, S., Panigrahi, B. (eds) Artificial Intelligence and Evolutionary Algorithms in Engineering Systems. Advances in Intelligent Systems and Computing, vol 324. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2126-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2126-5_2

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2125-8

  • Online ISBN: 978-81-322-2126-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation