Parameterized complexity of generalized vertex cover problems (2005)

Cached

Download Links

by Jiong Guo , Rolf Niedermeier , Sebastian Wernicke
Venue:In Proc. 9th WADS, volume 3608 of LNCS
Citations:20 - 2 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
878 Parameterized Complexity – Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen - 1998
366 Parameterized Complexity Theory – J Flum, M Grohe - 2006
912 Approximation Algorithms – V Vazirani - 2004
686 Approximation algorithms for combinatorial problems – D S Johnson - 1974
637 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998
1156 Graph Theory – FRANK HARARY - 1969
477 Reducibility among combinatorial problems, Complexity of Computer Computations – R M Karp - 1972
1453 Reducibility Among Combinatorial Problems – R M Karp - 1972