共 18 条
- [1] [Anonymous], 2004, SODA P 15 ANN ACM SI
- [3] On the hardness of approximating minimum vertex cover [J]. ANNALS OF MATHEMATICS, 2005, 162 (01) : 439 - 485
- [4] DOWNEY R, 1999, PARAMETERIZED COMPLE
- [5] Flum J., 2006, Parameterized Complexity Theory
- [6] Garey MR, 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
- [8] A note on the Consecutive Ones Submatrix problem [J]. INFORMATION PROCESSING LETTERS, 2002, 83 (03) : 163 - 166
- [9] HAJIAGHAYI MT, 2000, UNPUB CONSECUTIVE ON