Sciweavers

757 search results - page 18 / 152
» On the hardness of approximating Max-Satisfy
Sort
View
52
Voted
COMPGEOM
2007
ACM
15 years 1 months ago
Approximating the centroid is hard
Luis Rademacher
ESA
2004
Springer
85views Algorithms» more  ESA 2004»
15 years 1 months ago
Hardness and Approximation Results for Packing Steiner Trees
Joseph Cheriyan, Mohammad R. Salavatipour
FOCS
1992
IEEE
15 years 1 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
CPM
2008
Springer
132views Combinatorics» more  CPM 2008»
14 years 11 months ago
Constrained LCS: Hardness and Approximation
Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein