Author:
Azar Yossi,Boyar Joan,Favrholdt Lene M.,Larsen Kim S.,Nielsen Morten N.
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-Competitive On-Line Routing. In 34th IEEE Symposium on Foundations of Computer Science, pages 32–40, 1993.
2. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive Non-Preemptive Call Control. In Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 312–320, 1994.
3. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line Admission Control and Circuit Routing for High Performance Computation and Communication. In 35th IEEE Symposium on Foundations of Computer Science, pages 412–423, 1994.
4. J. Boyar and K. S. Larsen. The Seat Reservation Problem. Algorithmica, 25:403–417, 1999.
5. J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function — A Generalization of the Competitive Ratio. Tech. report 24, Department of Mathematics and Computer Science, University of Southern Denmark, Main Campus: Odense University, 1998. Extended version submitted for journal publication 1999.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bin Packing Approximation Algorithms: Survey and Classification;Handbook of Combinatorial Optimization;2013
2. On-Line Maximizing the Number of Items Packed in Variable-Sized Bins;Lecture Notes in Computer Science;2002
3. Extending the Accommodating Function;Lecture Notes in Computer Science;2002
4. Seat Reservation Allowing Seat Changes;Electronic Notes in Theoretical Computer Science;2001-08
5. On-Line Edge-Coloring with a Fixed Number of Colors;FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science;2000