1. Wiley-Interscience Series in Discrete Mathematics and Optimization;G. Nemhauser,1999
2. Meyerson, A., Munagala, K., Plotkin, S.: Cost-distance: two metric network design. In: 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, pp. 624–630. IEEE Comput. Soc. Press, Los Alamitos (2000)
3. Munagala, K.: Approximation algorithms for concave cost network flow problems. PhD thesis, Stanford University, Department of Computer Science (2003)
4. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows, Theory, algorithms, and applications. Prentice Hall Inc., Englewood Cliffs (1993)
5. Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. Assoc. Comput. Mach. 37, 843–862 (1990)