Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem

Francisco Barahona. Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem. In William J. Cook, Paul D. Seymour, editors, Polyhedral Combinatorics, Proceedings of a DIMACS Workshop, Morristown, New Jersey, USA, June 12-16, 1989. Volume 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 189-202, DIMACS/AMS, 1990.

Abstract

Abstract is missing.