|
147
|
A local-ratio theorem for approximating the weighted vertex cover problem
– R Bar-Yehuda, S Even
|
|
28
|
Covering problems with hard capacities
– J Chuzhoy, S Naor
|
|
561
|
Some optimal inapproximability results
– Johan Håstad
- 2002
|
|
506
|
Optimization, approximation and complexity classes
– C H Papadimitriou, M Yannakakis
- 1991
|
|
519
|
A Threshold of ln n for Approximating Set Cover
– Uriel Feige
- 1998
|
|
26
|
Hardness of approximate hypergraph coloring
– Venkatesan Guruswami, Madhu Sudan
|
|
62
|
Non-Approximability Results for Optimization Problems on Bounded Degree Instances
– Luca Trevisan
- 2001
|
|
74
|
Free bits, PCPs, and nonapproximability|towards tight results
– M Bellare, O Goldreich, M Sudan
- 1998
|
|
66
|
Efficient bounds for the stable set, vertex cover and set packing problems
– D S Hochbaum
- 1983
|
|
247
|
A Parallel Repetition Theorem
– Ran Raz
- 1998
|
|
13
|
Capacitated vertex covering
– Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or
- 2003
|
|
11
|
Improved approximation algorithms for the partial vertex cover problem
– Eran Halperin
- 2002
|
|
206
|
A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP
– Ran Raz , Shmuel Safra
- 1997
|
|
52
|
Ramsey numbers and an approximation algorithm for the vertex cover problem
– B Monien, E Speckenmeyer
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
23
|
Dependent Rounding in Bipartite Graphs
– Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan
|
|
1117
|
Reducibility Among Combinatorial Problems
– R Karp
- 1972
|
|
56
|
A Linear Time Approximation Algorithm For The Weighted Vertex Cover Problem
– B Yehuda, S Even
- 1981
|
|
577
|
Approximation algorithms for combinatorial problems
– D Johnson
- 1974
|
