Admission control to minimize rejections and online set cover with repetitions

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 238-244

  Alon, Noga ^a   Azar, Yossi ^a   Gutner, Shai ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Admission control; Competitive; On line; Set Cover

Indexed keywords

ALGORITHMS; POLYNOMIALS; SET THEORY;

ADMISSION CONTROL; ONLINE SET; SET COVER;

TELECOMMUNICATION NETWORKS;

EID: 32144457903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1074010     Document Type: Conference Paper

References (14)

1. R. Adler and Y. Azar. Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. Journal of Scheduling, 6:113-129, 2003.
2. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. The online set cover problem. In Proc. 35th ACM Symp. on Theory of Computing, pages 100-105, 2003.
3. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. A general approach to online network optimization problems. In Proc. 15rd ACM-SIAM Symp. on Discrete Algorithms, pages 577-586, 2004.
4. N. Alon and J. Spencer. The Probabilistic Method. Wiley, New York, Second Edition, 2000.
5. B. Awerbuch, Y. Azar, A. Fiat, and T. Leighton. Making commitments in the face of uncertainty: how to pick a winner almost every time. In Proc. 28th ACM Symp. on Theory of Computing, pages 519-530, 1996.
6. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive on-line routing. In Proc. 34th IEEE Symp. on Found. of Comp. Science, pages 32-40, 1993.
7. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive non-preemptive call control. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 312-320, 1994.
8. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computation and communication. In Proc. 35th IEEE Symp. on Found. of Comp. Science, pages 412-423, 1994.
9. Y. Azar, A. Blum, and Y. Mansour. Combining online algorithms for rejection and acceptance. In Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 159-163, 2003.
10. A. Blum, A. Kalai, and J. Kleinberg. Admission control to minimize rejections. In Proceedings of WADS 2001; LNCS 2125, pages 155-164, 2001.
11. D. Bunde and Y. Mansour. Improved combination of online algorithms for acceptance and rejection. In Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 265-266, 2004.
12. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233-235, 1979.
13. U. Feige. A threshold of 1n n for approximating set cover. Journal of the ACM, 45(4):634-652, July 1998.
14. U. Feige and S. Korman. Personal communication.