Design and performance of parallel and distributed approximation algorithms for Maxcut. Selected references Michel X. Goemans and David P. Williamson. David Karger, Rajeev Motwani, and Madhu Sudan. Approximate graph coloring by semidefinite programming. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts.
Fast approximation algorithms for multicommodity flow problems.
Fast approximation algorithms for fractional packing and covering problems. Sartaj Sahni and Teofilo Gonzalez. P-complete approximation problems. Farhad Shahrokhi and D. W. Matula. The maximum concurrent flow problem.