An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
Data Structures and Algorithms
2021-12-14 v1 Discrete Mathematics
Combinatorics
Abstract
We devise a constant-factor approximation algorithm for the maximization version of the edge-disjoint paths problem if the supply graph together with the demand edges form a planar graph. By planar duality this is equivalent to packing cuts in a planar graph such that each cut contains exactly one demand edge. We also show that the natural linear programming relaxations have constant integrality gap, yielding an approximate max-multiflow min-multicut theorem.
Keywords
Cite
@article{arxiv.2001.01715,
title = {An Approximation Algorithm for Fully Planar Edge-Disjoint Paths},
author = {Chien-Chung Huang and Mathieu Mari and Claire Mathieu and Kevin Schewior and Jens Vygen},
journal= {arXiv preprint arXiv:2001.01715},
year = {2021}
}