1. Ahuja, R.K., Magnati, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs (1993)
2. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501–555 (1998)
3. Bentz, C., Costa, M.-C., Létocard, L., Roupin, F.: Erratum to M.-C. Costa, L. Létocard and F. Roupin: Minimal multicut and maximal integer maxiflow: A survey. European Journal of Operational Research 162(1), 55–69 (2005); European Journal of Operational Research 177(2), 1312 (2007)
4. Brockhoff, D., Friedrich, T., Hebbinghaus, N., Klein, C., Neumann, F., Zitzler, E.: Do additional objectives make a problem harder? In: Proc. of the 9th Genetic and Evolutionary Comp. Conference (GECCO 2007), pp. 765–772. ACM Press, New York (2007)
5. Cheriyan, J., Karloff, H., Rabani, Y.: Approximating directed multicuts. In: Proc. of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 320–328 (2001)