1. Lecture Notes in Computer Science;M. Babaioff,2007
2. Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exch. 7(2), 1–11 (2008)
3. Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007, Philadelphia, PA, USA. pp. 434–443, Society for Industrial and Applied Mathematics (2007)
4. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: STOC 1998: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 161–168 (1998)
5. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)