by Steven S. Seiden
Proceedings of the thirty-second annual ACM symposium on theory of computing (STOC), 2000
http://bit.csc.lsu.edu/~seiden/guess.ps.Z
Add To MetaCart
Abstract:
We present the rst general framework for proving lower bounds for randomized online algorithms using the von Neumann/Yao principle. This framework encompasses and explains many existent lower bound results, and allows us to prove several new ones. The foremost of the new results is a lower bound of 1.58197 for the online TCP acknowledgment problem of Dooly, Goldman and Scott [11]. Other new results include: a lower bound of 1.34880 for randomized online two-machine
ow shop scheduling, a lower bound of 1.15775 for randomized online total completion time scheduling on parallel machines and a lower bound of 1.06532 for scheduling with machine cost. Out method provides a sort of `Master theorem ' for proving randomized lower bounds. 1
Citations
|
180
|
Competitive snoopy caching
– Karlin, Manasse, et al.
- 1988
|
|
165
|
An optimal online algorithm for metrical task system
– Borodin, Linial, et al.
- 1992
|
|
127
|
On the power of randomization in on-line algorithms
– Ben-David, Borodin, et al.
- 1994
|
|
91
|
Competitive randomized algorithms for nonuniform problems
– Karlin, Manasse, et al.
- 1994
|
|
81
|
Amortized eciency of list update and paging rules
– Sleator, E
- 1985
|
|
71
|
Approximation techniques for average completion time scheduling
– Chekuri, Motwani, et al.
- 1997
|
|
58
|
Competitive Algorithms for Replication and Migration Problems
– Black, Sleator
- 1989
|
|
37
|
A polylog(n)-competitive algorithm for metrical task systems
– Bartal, Blum, et al.
- 1997
|
|
22
|
New on-line algorithms for the page replication problem
– Albers, Koga
|
|
20
|
On-line machine scheduling
– Vestjens
- 1997
|
|
15
|
Unfair problems and randomized algorithms for metrical task systems
– Seiden
- 1999
|
|
13
|
TCP dynamic acknowledgement delay: Theory and practice
– Dooly, Goldman, et al.
|
|
10
|
On randomization in online computation
– Borodin, El-Yaniv
- 1997
|
|
7
|
On The Bahncard Problem
– Fleischer
- 1998
|
|
6
|
Scheduling on identical machines: How good is LPT in an on-line setting
– Chen, Vestjens
- 1997
|
|
6
|
Randomized on-line scheduling: How low can't you go
– Stougie, Vestjens
- 1997
|
|
3
|
Scheduling two machines with release times
– Noga, Seiden
- 1999
|
|
2
|
replication—Variations on a theme
– Fleischer, Seiden
- 1999
|
|
2
|
Scheduling with Machine Cost
– Imreh, Noga
- 1999
|
|
2
|
Randomized online scheduling with delivery times
– Seiden
- 1999
|
