Sciweavers

4843 search results - page 53 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
96
Voted
COCO
1997
Springer
77views Algorithms» more  COCO 1997»
15 years 6 months ago
Constraint Satisfaction: The Approximability of Minimization Problems
Sanjeev Khanna, Madhu Sudan, Luca Trevisan
83
Voted
ISAAC
1995
Springer
133views Algorithms» more  ISAAC 1995»
15 years 6 months ago
An Approximation Algorithm for Alphabet Indexing Problem
Shinichi Shimozono
115
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...
125
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...
91
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...