Next: MINIMUM MAXIMUM DISJOINT CONNECTING Up: Flow Problems Previous: MAXIMUM INTEGRAL K-MULTICOMMODITY FLOW Index

### MAXIMUM DISJOINT CONNECTING PATHS

- INSTANCE: Multigraph , collection of vertex pairs .

- SOLUTION: A collection of edge disjoint paths in G connecting some of the pairs (si,ti), i.e. sequences of vertices such that, for some i, u1=si, um=ti, and for any j, .

- MEASURE: The number of vertex pairs (si,ti) that are connected by the paths.

- Good News: Approximable within [424].

- Comment: Similar to MINIMUM UNSPLITTABLE FLOW. Approximable within for constant degree graphs and butterfly graphs [424]. Approximable within 2 if G is a tree with parallel edges. Approximable within if G is a two-dimensional mesh [40], or more generally, if G is a nearly-Eulerian uniformly high-diameter planar graph [307].

  Variation in which the objective is to minimize the number of rounds that together connect all pairs, is approximable within on general multigraphs and within on butterfly graphs [424].

  MINIMUM PATH COLORING is the variation in which each path is assigned a color, where only paths with the same color need to be edge disjoint, and where the objective is to minimize the number of colors that are needed to connect all vertex pairs in the input. This problem is approximable within 3/2 on trees, within 2 on cycles [393], within on two-dimensional meshes [391], and within on nearly-Eulerian uniformly high-diameter planar graphs [307].

- Garey and Johnson: Similar to ND40

Next: MINIMUM MAXIMUM DISJOINT CONNECTING Up: Flow Problems Previous: MAXIMUM INTEGRAL K-MULTICOMMODITY FLOW Index