Improved Parameterized Upper Bounds for Vertex Cover

  • Jianer Chen
  • Iyad A. Kanj
  • Ge Xia
Conference paper

DOI: 10.1007/11821069_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4162)
Cite this paper as:
Chen J., Kanj I.A., Xia G. (2006) Improved Parameterized Upper Bounds for Vertex Cover. In: Královič R., Urzyczyn P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg

Abstract

This paper presents an O(1.2738k + kn)-time polynomial-space parameterized algorithm for Vertex Cover improving the previous O(1.286k + kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. The algorithm also improves the O(1.2745kk4 + kn)-time exponential-space upper bound for the problem by Chandran and Grandoni.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jianer Chen
    • 1
  • Iyad A. Kanj
    • 2
  • Ge Xia
    • 3
  1. 1.Department of Computer ScienceTexas A&M UniversityCollege StationUSA
  2. 2.School of Computer Science, Telecommunications and Information SystemsDePaul UniversityChicagoUSA
  3. 3.Department of Computer ScienceLafayette CollegeEastonUSA

Personalised recommendations