A kernel of order 2k-c for Vertex Cover

Discrete Mathematics

Volumn 311, Issue 10-11, 2011, Pages 892-895

  Soleimanfallah, Arezou ^a   Yeo, Anders ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Fixed parameter tractable; Kernel; Vertex Cover

Indexed keywords

EID: 79952353118     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2011.02.014     Document Type: Article

References (14)

1. C. Berge Graphs and Hypergraphs 1973 North-Holland Publishing Co. (Chapter 8)
2. J. Chen, H. Fernau, I. Kanj, and G. Xia Parametric duality and kernelization: lower bounds and upper bounds on kernel size SIAM Journal of Computing 37 4 2007 1077 1106
3. C. Chen, I. Kanj, and W. Jia Vertex cover: further observations and further improvements Journal of Algorithms 41 2001 280 301 (Pubitemid 33665542)
4. M. Chlebk, and J. Clebkov Crown reductions for the minimum weighted vertex cover problem Discrete Applied Mathematics 156 2008 292 312
5. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer-Verlag
6. J. Edmonds Paths, trees and flowers Canadian Journal of Mathematics 17 1965 449 467
7. S. Even, A. Itai, and A. Shamir On the complexity of timetable and multicommodity flow problems SIAM Journal of Computing 5 4 1976 691 703
8. H.Th. Jongen, K. Meer, and E. Triesch Optimization Theory 2004 Springer
9. S. Khot, and O. Regev Vertex cover might be hard to approximate to within 2 - ε Journal of Computer and System Sciences 73 3 2008 335 349
10. S. Khuller, Algorithms column: the vertex cover problem, Technical Report MD 20742, University of Maryland, 2002.
11. S. Micali, V.V. Vazirani, An O (| V | · | E | ) algorithm for finding maximum matching in general graphs, in: Proc. 21st IEEE Symposium. Foundations of Computer Science, 1980, pp. 1727. doi:10.1109/SFCS.1980.12.
12. R. Motwani, Lecture notes on approximation algorithms, Technical Report STANCS-92-1435, Stanford University, 1992.
13. G.L. Nemhauser, and L.E. Trotter Vertex packing: structural properties and algorithms Mathematical Programming 8 1975 232 248
14. R. Niedermeier Invitation to Fixed-Parameter Algorithms Oxford Lecture Series in Mathematics and its Applications 2006 Oxford University Press