1. LNCS;S. Aland,2006
2. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’97), pp. 493–500 (1997)
3. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602–1623 (2008)
4. Avidor, A., Azar, Y., Sgall, J.: Ancient and new algorithms for load balancing in the L p norm. Algorithmica 29(3), 422–441 (2001)
5. Awerbuch, B., Azar, Y., Grove, E.F., Kao, M.-Y., Krishnan, P., Vitter, J.S.: Load balancing in the L p norm. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS ’95), pp. 383–391 (1995)