171
Voted
FOCS
1998
IEEE
15 years 11 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...
172
Voted
FOCS
1998
IEEE
15 years 11 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...
145
Voted
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
127
Voted
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
145
Voted
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
149
Voted
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
112
Voted
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
242
Voted
FOCS
1998
IEEE
15 years 11 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...
220
click to vote
FOCS
1998
IEEE
15 years 11 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...