Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs

Cédric Bentz 1
1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Abstract : We generalize all the results obtained for integer multiflow and multicut problems in trees by Garg et al. [N. Garg, V.V. Vazirani and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 (1997), pp. 3-20] to planar graphs with a fixed number of faces, although other classical generalizations do not lead to such results. We also introduce the class of k-edge-outerplanar graphs and bound the integrality gap for the maximum edge-disjoint paths problem in these graphs.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01125124
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:00:04 AM
Last modification on : Monday, January 20, 2020 - 8:08:53 PM

Identifiers

  • HAL Id : hal-01125124, version 1

Collections

Citation

Cédric Bentz. Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs. ICGT'05 7th Int. Colloquium on Graph Theory, Hyeres, Jan 2005, X, France. pp.55-60. ⟨hal-01125124⟩

Share

Metrics

Record views

44