Randomized priority algorithms (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2909, Issue , 2004, Pages 27-40

  Angelopoulos, Spyros ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; APPROXIMATION ALGORITHMS;

APPROXIMABILITY; APPROXIMATION RATIOS; EXTENDED ABSTRACTS; FACILITY LOCATIONS; GREEDY-LIKE ALGORITHMS; PRIORITY ALGORITHMS; SCHEDULING PROBLEM; UPPER AND LOWER BOUNDS; LOWER BOUNDS;

APPROXIMATION ALGORITHMS; ALGORITHMS;

EID: 35048825708     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24592-6_3     Document Type: Article

References (30)

1. S. Albers. On randomized online scheduling. In Proceedings of the 34th Annual ACM Symposium on Theory of Computation, pages 134-143, 2002.
2. S. Angelopoulos and A. Borodin. On the power of priority algorithms for facility location and set cover. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 26-39, 2002.
3. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating throughput in real-time scheduling. SIAM Journal of Computing, 31(2):331-352, 2001.
4. Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences, 51(3):359-366, 1995.
5. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the power of randomization in online algorithms. Algorithmica, 11(1):2-14, 1994.
6. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
7. A. Borodin, N. Linial, and M.E. Saks. An optimal algorithm for metrical task systems. Journal of the ACM, 39(4):745-763, 1992.
8. A. Borodin, M. Nielsen, and C. Rackoff. (Incremental) priority algorithms. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 752-761, 2002.
9. B. Chen, A. van Vliet, and G. J. Woeginger. A lower bound for randomized on-line scheduling algorithms. Information Processing Letters, 51:219-222, 1994.
10. M. Chrobak, L. Larmore, N. Reingold, and J. Westbrook. A better lower bound on the competitive ratio of the randomized 2-server problem. Information Processing Letters, 63:79-83, 1997.
11. R. Fleischer and M. Wahl. Online scheduling revisited. In Proceedings of the 8th Annual European Symposium on Algorithms, pages 202-210, 2000.
12. D. Fotakis. On the competitive ratio for online facility location. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, pages 637-652, 2003.
13. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, NY, 2nd edition, 1983.
14. T. Gormley, N. Reingold, E. Torng, and J. Westbrook. Generating adversaries for request-answer games. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pages 564-565, 2000.
15. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell Sys. Tech. J., 45:1563-1581, 1966.
16. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2):416-429, 1969.
17. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 649-657, 1998.
18. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34(1):144-162, 1987.
19. R. Impagliazzo and S. Davis. Models of greedy algorithms for graph problems. In Proceedings of the 15th Symposium on Discrete Algorithms, 2004. To appear.
20. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In Proceedings of the 34th Annual ACM Symposium on Theory of Computation, pages 731-740, 2002.
21. M. Mahdian, E. Markakis, A. Saberi, and V. V. Vazirani. A greedy facility location algorithm analyzed using dual fitting. In Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 127-137, 2001.
22. M. Mahdian, J. Ye, and J. Zhang. A 1.52-approximation algorithm for the uncapacitated facility location problem. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 229-242, 2002.
23. R. R. Mettu and C. G. Plaxton. The online median problem. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 339-348, 2000.
24. A. Meyerson. Online facility location. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 426-431, 2001.
25. S. K. Sahni. Algorithms for scheduling independent tasks. Journal of the ACM, 23(1):116-127, 1976.
26. S. Seiden, J. Sgall, and G. J. Woeginger. Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27(5):215-221, 2000.
27. J. Sgall. A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters, 63:51-55, 1997.
28. J. Sgall. On-line scheduling-a survey. In A. Fiat and G. Woeginger, editors, Online Algorithms: The State of the Art, Lecture Notes in Computer Science, pages 196-231. Springer Verlag, 1998.
29. D.B. Shmoys. Approximation algorithms for facility location problems. In K. Jansen and S. Khuller, editors, Approximation Algorithms for Combin. Optimization, volume 1913 of LNCS. Springer, 2000.
30. D.B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems (extended abstract). In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 265-274, 1997.