Sciweavers

4894 search results - page 58 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
82
Voted
ISAAC
1995
Springer
133views Algorithms» more  ISAAC 1995»
15 years 6 months ago
An Approximation Algorithm for Alphabet Indexing Problem
Shinichi Shimozono
113
Voted
FOCS
1991
IEEE
15 years 6 months ago
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Serge A. Plotkin, David B. Shmoys, Éva Tard...
124
Voted
FOCS
1992
IEEE
15 years 6 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...
89
Voted
STOC
1991
ACM
95views Algorithms» more  STOC 1991»
15 years 6 months ago
Fast Approximation Algorithms for Multicommodity Flow Problems
Frank Thomson Leighton, Fillia Makedon, Serge A. P...
65
Voted
ATAL
2008
Springer
15 years 4 months ago
An anytime approximation method for the inverse Shapley value problem
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....