Skip to Main content Skip to Navigation
Reports

Edge disjoint paths and multicut problems in graphs generalizing the trees

Abstract : We generalize all the results obtained for trees in [N. Garg, V. Vazirani, M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 (1997), pp. 3-20] to graphs with a fixed cyclomatic number. Moreover, we show that, for a fixed number of source-sink pairs, the minimum multicut problem is polynomial-time solvable in planar graphs and in bounded tree-width graphs. Eventually, we introduce the class of k-edge-outerplanar graphs and show that the integrality gap of the maximum edge-disjoint paths problem is bounded in these graphs.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01125123
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:00:03 AM
Last modification on : Friday, January 10, 2020 - 11:24:02 AM

Identifiers

  • HAL Id : hal-01125123, version 1

Collections

Citation

Cédric Bentz. Edge disjoint paths and multicut problems in graphs generalizing the trees. [Research Report] CEDRIC-05-948, CEDRIC Lab/CNAM. 2005. ⟨hal-01125123⟩

Share

Metrics

Record views

27