1. Awerbuch, B., Azar, Y., Plotkin, S.A.: Throughput-competitive on-line routing. In: FOCS, pp. 32–40 (1993)
2. Azar, Y., Feige, U., Glasner, D.: A preemptive algorithm for maximizing disjoint paths on trees. Algorithmica 57(3), 517–537 (2010)
3. Bienstock, D., Iyengar, G.: Approximating fractional packings and coverings in o(1/epsilon) iterations. SIAM J. Comput. 35(4), 825–854 (2006)
4. Birge, J., Louveaux, F.: Introduction to stochastic programming. Springer (1997)
5. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)