Edge-Disjoint Paths in Planar Graphs with Constant Congestion

The authors study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) ... , the goal is to maximize the number of demands that can be connected (routed) by edge-disjoint paths. The natural multicommodity flow relaxation has an ... small const...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 39; no. 1; pp. 281 - 301
Main Authors Chekuri, Chandra, Khanna, Sanjeev, Shepherd, F Bruce
Format Journal Article
LanguageEnglish
Published Philadelphia Society for Industrial and Applied Mathematics 01.01.2009
Subjects
Approximation
Congestion
Decomposition
Demand
Graphs
Marketing
Mathematical analysis
Mathematical problems
Studies
Symbols
Online AccessGet full text

Cover

More Information
Summary:The authors study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) ... , the goal is to maximize the number of demands that can be connected (routed) by edge-disjoint paths. The natural multicommodity flow relaxation has an ... small constant congestion ... that is, solutions in which up to c paths are allowed to use an edge (alternatively, each edge has a capacity of c). In previous work they obtained an ... approximation with congestion 2 via the flow relaxation. This was based on a method of decomposing into well-linked subproblems. In this paper they obtain an ... approximation with congestion 4. To obtain this improvement they develop an alternative decomposition that is specific to planar graphs. (ProQuest: ... denotes formulae/symbols omitted.)
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0097-5397
1095-7111
DOI:10.1137/060674442