Improved upper bounds for vertex cover

  title={Improved upper bounds for vertex cover},
  author={Jianer Chen and Iyad A. Kanj and Ge Xia},
  journal={Theor. Comput. Sci.},
This paper presents anO(1.2738k+kn)-time polynomial-space algorithm forVertex Cover improving the previous O(1.286k + kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. Most of the previous algorithms rely on exhaustive case-by-case branching rules, and an underlying conservativeworst-case-scenario assumption. The contribution of the paper lies in the simplicity, uniformity, and obliviousness of the algorithm presented. Several new techniques, as well as generalizations of previous… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.


Publications referenced by this paper.

Similar Papers

Loading similar papers…