Skip to main content
SpringerLink
Log in

Vertex Cover: Further Observations and Further Improvements

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 1999)

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

Included in the following conference series:

Abstract

Recently, there have been increasing interests and progresses in lowering the worst case time complexity for well-known NP-hard problems, in particular for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated and several new techniques are introduced, which lead to a simpler and improved algorithm of time complexity O(kn + 1.271k k 2) for the problem. Our algorithm also induces improvement on previous algorithms for the Independent Set problem on graphs of small degree.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balasubramanian, R., Fellows, M. R., and Raman, V.: An Improved Fixed Parameter Algorithm for Vertex Cover. Information Processing Letters 65 (1998) 163–168 313, 314, 315

    Article  MathSciNet  Google Scholar 

  2. Buss, J. F. and Goldsmith, J.: Nondeterminism within P. SIAM Journal on Computing 22 (1993) 560–572 313, 314

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen, J., Kanj, I. A., and Jia, W.: Vertex Cover: Further Observation and Further Improvements. Tech. Rep., Dept. of Computer Science, Texas A&M University (1999) 317, 318, 320

    Google Scholar 

  4. Downey, R. G. and Fellows, M. R.: Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM Journal on Computing 24 (1995) 873–921 313, 323

    Article  MATH  MathSciNet  Google Scholar 

  5. Downey, R. G. and Fellows, M. R.: Parameterized Computational Feasibility, In: Clote P. and Remmel J. (eds.): Feasible Mathematics II. Boston, Birkhauser (1995) 219–244 313, 323

    Google Scholar 

  6. Downey, R. G., Fellows, M. R., and Stege, U.: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. In: Roberts, F., Kratochvil, J., and Nesetril, J. (eds.): Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. AMS-DIMACS Proceedings Series 49 (1999) 49–99 313, 314, 314, 315

    Google Scholar 

  7. Hallett, M., Gonnet, G., and Stege, U.: Vertex Cover Revisited: A Hybrid Algorithm of Theory and Heuristic. Manuscript. (1998) 313

    Google Scholar 

  8. Jian, T.: An O(20.304n) Algorithm for Solving Maximum Independent Set Problem. IEEE Trans. Comput. 35 (1986) 847–851 314, 323

    Article  MATH  Google Scholar 

  9. Knuth, D. E.: The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, Mass. (1968) 321, 321

    MATH  Google Scholar 

  10. Niedermeier, R. and Rossmanith, P.: Upper Bounds for Vertex Cover Further Improved. Proc. of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99). Lecture Notes in Computer Science 1563 (1999) 561–570 313, 314, 314, 315, 321

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Robson, J. M.: Algorithms for Maximum Independent Sets. Journal of Algorithms 7 (1986) 425–440 314, 314, 314, 321, 323, 324

    Article  MATH  MathSciNet  Google Scholar 

  13. Shindo, M. and Tomita, E.: A Simple Algorithm for Finding A Maximum Clique and Its Worst-Case Time Complexity. Sys. and Comp. in Japan 21 (1990) 1–13 314, 323

    Article  MathSciNet  Google Scholar 

  14. Tarjan, R. E. and Trojanowski, A. E.: Finding A Maximum Independent Set. SIAM Journal on Computing 6 (1977) 537–546 313, 323

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Texas A&M University, College Station, Texas, USA

    Jianer Chen & Iyad A. Kanj

  2. Dept. of Computer Science, City University of HongKong, HongKong SAR, China

    Weijia Jia

Authors
  1. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Iyad A. Kanj
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weijia Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science ETH Zürich ETH Zentrum, 8092, Zürich, Switzerland

    Peter Widmayer , Gabriele Neyer  & Stephan Eidenbenz ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, J., Kanj, I.A., Jia, W. (1999). Vertex Cover: Further Observations and Further Improvements. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds) Graph-Theoretic Concepts in Computer Science. WG 1999. Lecture Notes in Computer Science, vol 1665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46784-X_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-46784-X_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66731-5

  • Online ISBN: 978-3-540-46784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation