FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
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...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...