A kernel of order 2 k - Clog k for vertex cover

Information Processing Letters

Volumn 111, Issue 23-24, 2011, Pages 1089-1091

  Lampis, Michael ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Graph algorithms; Kernelization algorithm; Parameterized complexity; Vertex cover

Indexed keywords

GRAPH ALGORITHMS; KERNELIZATION; ORDER 2; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; VERTEX COVER;

POLYNOMIAL APPROXIMATION; POTASSIUM;

ALGORITHMS;

EID: 80053355349     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2011.09.003     Document Type: Article

References (13)

1. J. Chen, H. Fernau, I. Kanj, and G. Xia Parametric duality and kernelization: Lower bounds and upper bounds on kernel size SIAM Journal on Computing 37 4 2008 1077 1106
2. J. Chen, I. Kanj, and W. Jia Vertex Cover: Further observations and further improvements Journal of Algorithms 41 2 2001 280 301 (Pubitemid 33665542)
3. M. Chlebík, and J. Chlebíková Crown reductions for the minimum weighted vertex cover problem Discrete Applied Mathematics 156 3 2008 292 312
4. M. Cygan, M. Pilipczuk, M. Pilipczuk, and J.O. Wojtaszczyk On multiway cut parameterized above lower bounds CoRR abs/1107.1585 2011
5. H. Dell, and D. van Melkebeek Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses L.J. Schulman, STOC 2010 ACM 251 260
6. J. Edmonds Paths, trees, and flowers Canadian Journal of Mathematics 17 1965 449 467
7. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer-Verlag New York
8. S. Khot, and O. Regev Vertex cover might be hard to approximate to within 2-[epsilon] Journal of Computer and System Sciences 74 3 2008 335 349
9. D. Marx, and I. Razgon Fixed-parameter tractability of multicut parameterized by the size of the cutset L. Fortnow, S.P. Vadhan, STOC 2011 ACM 469 478
10. G. Nemhauser, and L. Trotter Vertex packings: structural properties and algorithms Mathematical Programming 8 1 1975 232 248
11. R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
12. I. Razgon, and B. OSullivan Almost 2-SAT is fixed-parameter tractable Journal of Computer and System Sciences 75 8 2009 435 450
13. A. Soleimanfallah, and A. Yeo A kernel of order 2k-c for Vertex Cover Discrete Mathematics 311 10-11 2011 892 895