Sciweavers

4843 search results - page 53 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
COCO
1997
Springer
77views Algorithms» more  COCO 1997»
14 years 1 months ago
Constraint Satisfaction: The Approximability of Minimization Problems
Sanjeev Khanna, Madhu Sudan, Luca Trevisan
FOCS
1992
IEEE
14 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...
STOC
1991
ACM
95views Algorithms» more  STOC 1991»
14 years 1 months ago
Fast Approximation Algorithms for Multicommodity Flow Problems
Frank Thomson Leighton, Fillia Makedon, Serge A. P...