1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Networks Flows. Prentice Hall, Englewood Cliffs, 1993.
2. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive non-preemptive call control. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 312–320, 1994.
3. B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosén. On-line competitive algorithms for call admission in optical networks. Algorithmica, 31:29–43, 2001.
4. P. Baptiste. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2:245–252, 1999.
5. S. K. Baruah, J. Haritsa, and N. Sharma. On-line scheduling to maximize task completions. Journal of Combinatorial Mathematics and Combinatorial Computing, 39:65–78, 2001.