Sciweavers

FOCS
1998
IEEE
13 years 12 months ago
Which Problems Have Strongly Exponential Complexity?
Russell Impagliazzo, Ramamohan Paturi, Francis Zan...
FOCS
1998
IEEE
13 years 12 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
FOCS
1998
IEEE
13 years 12 months ago
Testing Monotonicity
Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dan...
FOCS
1998
IEEE
13 years 12 months ago
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
Naveen Garg, Jochen Könemann
FOCS
1998
IEEE
13 years 12 months ago
Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations
Alan M. Frieze, Ravi Kannan, Santosh Vempala
FOCS
1998
IEEE
13 years 12 months ago
On the Single-Source Unsplittable Flow Problem
Yefim Dinitz, Naveen Garg, Michel X. Goemans
FOCS
1998
IEEE
13 years 12 months ago
The Finite Capacity Dial-A-Ride Problem
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
Moses Charikar, Balaji Raghavachari