1. Azar, Y., Gamzu, I.: Ranking with submodular valuations. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 1070–1079. Society for Industrial and Applied Mathematics, Philadelphia (2011)
2. Azar, Y., Gamzu, I., Yin, X.: Multiple intents re-ranking. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 669–678. ACM, New York (2009)
3. Bansal, N., Gupta, A., Krishnaswamy, R.: A constant factor approximation algorithm for generalized min-sum set cover. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 1539–1545. Society for Industrial and Applied Mathematics, Philadelphia (2010)
4. Bar-Yehuda, R., Even, G., Feldman, J., Naor, J.S.: Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems. J. Graph Algorithms Appl. 5, 1–27 (2001)
5. Barenholz, U., Feige, U., Peleg, D.: Improved approximation for min-sum vertex cover (2006)