1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
2. Anthes, B., Rüschendorf, L.: On the weighted Euclidean matching problem in R
d
dimensions. Applicationes Mathematicae 28(2), 181–190 (2001)
3. Arthur, D., Manthey, B., Röglin, H.: k-means has polynomial smoothed complexity. In: Proc. 50th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 405–414. IEEE, Los Alamitos (2009)
4. Beier, R., Vöcking, B.: Random knapsack in expected polynomial time. J. Comput. System Sci. 69(3), 306–329 (2004)
5. Lecture Notes in Computer Science;V. Damerow,2004