Search Sciweavers | Sciweavers

4894 search results - page 58 / 979

» The Guarding Problem - Complexity and Approximation

click to vote

ISAAC
1995
Springer

133views Algorithms» more ISAAC 1995»

An Approximation Algorithm for Alphabet Indexing Problem

14 years 13 days ago

Download qir.kyushu-u.ac.jp

Shinichi Shimozono

claim paper

Read More »

click to vote

FOCS
1991
IEEE

114views Theoretical Computer Science» more FOCS 1991»

Fast Approximation Algorithms for Fractional Packing and Covering Problems

14 years 13 days ago

Download infolab.stanford.edu

Serge A. Plotkin, David B. Shmoys, Éva Tard...

claim paper

Read More »

click to vote

FOCS
1992
IEEE

133views Theoretical Computer Science» more FOCS 1992»

Proof Verification and Hardness of Approximation Problems

14 years 12 days ago

Download people.csail.mit.edu

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...

claim paper

Read More »

click to vote

STOC
1991
ACM

95views Algorithms» more STOC 1991»

Fast Approximation Algorithms for Multicommodity Flow Problems

14 years 12 days ago

Download historical.ncstrl.org

Frank Thomson Leighton, Fillia Makedon, Serge A. P...

claim paper

Read More »

click to vote

ATAL
2008
Springer

122views Intelligent Agents» more ATAL 2008»

An anytime approximation method for the inverse Shapley value problem

13 years 11 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers