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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
Buss, J. F. and Goldsmith, J.: Nondeterminism within P. SIAM Journal on Computing 22 (1993) 560–572 313, 314
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
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
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
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
Hallett, M., Gonnet, G., and Stege, U.: Vertex Cover Revisited: A Hybrid Algorithm of Theory and Heuristic. Manuscript. (1998) 313
Jian, T.: An O(20.304n) Algorithm for Solving Maximum Independent Set Problem. IEEE Trans. Comput. 35 (1986) 847–851 314, 323
Knuth, D. E.: The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, Mass. (1968) 321, 321
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
Nemhauser, G. L. and Trotter, L. E.: Vertex Packing: Structural Properties and Algorithms. Mathematical Programming 8 (1975) 232–248 314, 314
Robson, J. M.: Algorithms for Maximum Independent Sets. Journal of Algorithms 7 (1986) 425–440 314, 314, 314, 321, 323, 324
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
Tarjan, R. E. and Trojanowski, A. E.: Finding A Maximum Independent Set. SIAM Journal on Computing 6 (1977) 537–546 313, 323
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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