1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
2. Anthes, B., Rüschendorf, L.: On the weighted Euclidean matching problem in $\mathbb{R}^{d}$ . Appl. Math. 28(2), 181–190 (2001)
3. Arthur, D., Manthey, B., Röglin, H.: Smoothed analysis of the k-means method. J. ACM 58(5), 19 (2011)
4. Beier, R., Vöcking, B.: Random knapsack in expected polynomial time. J. Comput. Syst. Sci. 69(3), 306–329 (2004)
5. Lecture Notes in Computer Science;M. Bläser,2011