1. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, 1979, Freeman, San Francisco, CA.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 14–23.
3. C. Lund, M. Yannakakis, On the hardness of approximating minimization problems, 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 960–981.
4. P. Raghavan, C. Thompson, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica 7 (1987) 365–374.
5. A. Srivastav, P. Stangier, Integer multicommodity flows with reduced demands, Proceedings of the First European Symposium on Algorithms, Lecture Notes in Computer Science, no. 726, Springer, Berlin, 1993, pp. 360–372.