(Incremental) priority algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 752-761

  Borodin, Allan ^a   Nielsen, Morten N ^b   Rackoff, Charles ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL EFFICIENCY; OPTIMIZATION;

APPROXIMATION BOUNDS; CONCEPTUAL SIMPLICITY; GREEDY ALGORITHMS; ONLINE COMPETITIVE ANALYSIS; OPTIMIZATION PROBLEMS; PRECISE DEFINITION; PRIORITY ALGORITHMS; SCHEDULING PROBLEM;

ALGORITHMS;

EID: 79959749444     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. E. M. Arkin and E. L. Silverberg. Scheduling jobs with fixed start and end times. Disc. Appl. Math, 18:1-8, 1987.
2. James Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, and Orli Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3):486-504, May 1997.
3. Y. Azar, J. Naor, and R. Rom. The competitiveness of online assignments. Journal of Algorithms, 18(2):221-237, 1995.
4. Bar-Noy, Guha, Naor, and Schieber. Approximating the throughput of multiple machines under real-time scheduling. In STOC: ACM Symposium on Theory of Computing, 1999.
5. S. Baruah, G. Koren, B. Mishra, A. Ragbunathon, L. Rosier, and D. Shasha. On-line scheduling in the presence of overload. In FOCS: IEEE Symposium of Foundations of Computing, pages 100-110, 1991.
6. Gilles Brassard and Paul Bratley. Introduction to Algorithms, chapter 6. Prentice Hall, Englewood Cliffis, New Jersey., 1996.
7. M.C. Carlisle and E.L. Llyod. On the k-coloring of intervals. Lecture Notes in Computer Science, 497:90-101, 1991.
8. M. Charikar, C. Chekuri, T. Feder, and R. Mot-wani. Incremental clustering and dynamic information retrieval. In STOC: ACM Symposium on Theory of Computing, pages 626-635, 1997.
9. Thomas H Cormen, Charles E Leiserson, and Ronald L Rivest. Introduction to Algorithms, chapter 28. MIT Press, Cambridge, Mass., 1990.
10. U. Faigle and W.M. Nawijn. Greedy kdecomposition of interval orders. In Proceedings of the Second Twente Workshop in Graphs and Combinatorial Optimization, pages 53-56, University of Twente, 1991.
11. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman, New York City, New York., 1996.
12. T.E. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985.
13. R. L. Graham. Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal, 45:1563-1581, 1966.
14. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(1):416-429, March 1969.
15. R. L. Graham, E-L-Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Mathematics, 5:287-326, 1979.
16. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: practical and theoretical results-Journal of the ACM, 34:144-162, 1987.
17. G. Koren and D. Shasha. Moca: a multiprocessor on-line competitive scheduling algorithm for realtime system scheduling. Theoretical Computer Science, 128:75-97, 1994.
18. E. L. Lawler, J. K. Lenstra, A. H. G-Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, and P. Zipkin, editors, Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory. North-Holland, Amsterdam, 1993.
19. Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, and Adi Rosen. On-line randomized call control revisited. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 323-332, San Francisco, California, jan 1998.
20. B.M.E. Moret and H.D. Shapiro. Algorithms from P to NP, chapter 5. Benjamin/Cummings, Redwood City, California, 1991.
21. Sartaj K. Sahni. Algorithms for scheduling independent tasks. Journal of the ACM, 23(1):116-127, January 1976.
22. J. Sgall. On-line scheduling. Lecture Notes in Computer Science, 1442:196-231, 1998.
23. Steve Sieden, Jiri Sgall, and Gerhard Woeginger. Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27(5):215-221, 2000