Sciweavers

4894 search results - page 58 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
FOCS
1992
IEEE
15 years 11 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...
156
Voted
STOC
1991
ACM
95views Algorithms» more  STOC 1991»
15 years 11 months ago
Fast Approximation Algorithms for Multicommodity Flow Problems
Frank Thomson Leighton, Fillia Makedon, Serge A. P...
109
Voted
ATAL
2008
Springer
15 years 9 months ago
An anytime approximation method for the inverse Shapley value problem
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....