On-line bin-stretching

Theoretical Computer Science

Volumn 268, Issue 1, 2001, Pages 17-41

  Azar, Yossi ^a   Regev, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Bin stretching; Bin packing; Load balancing; On line algorithms; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ONLINE SYSTEMS;

BIN-PACKING;

COMPUTER SCIENCE;

EID: 0035818334     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00258-9     Document Type: Conference Paper

References (24)

1. Better bounds for on-line scheduling
2. On-line load balancing with applications to machine scheduling and virtual circuit routing
3. Competitive routing of virtual circuits with unknown duration
4. On-line load balancing
5. On-line load balancing of temporary tasks on identical machines
6. On-line load balancing of temporary tasks
7. New algorithms for an ancient scheduling problem
8. A lower bound for randomized on-line scheduling algorithms
9. New lower and upper bounds for on-line scheduling
10. Approximation algorithms for bin packing: A survey
11. On the performance of online algorithms for partition problems
12. An on-line scheduling heuristic with better worst case ratio than graham's list scheduling
13. Bounds for certain multiprocessor anomalies
14. Bounds on multiprocessing timing anomalies
15. Using dual approximation algorithms for scheduling problems: Theoretical and practical results
16. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
17. A better algorithm for an ancient scheduling problem
18. Semi on-line algorithms for the partition problem