1. Network Flows;Ahuja,1993
2. Polynomial-time approximation schemes for dense instances of NP-hard problems;Arora,1995
3. Proof verification and hardness of approximation problems;Arora,1992
4. Nonlinear formulations and improved randomized approximation algorithms for multicut problems;Bertsimas,1995
5. S. Chopra, and, L. H. Owen, Extended formulations for the A-cut problem, preprint, 1994.