Work

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths

Year: 2021

Type: article

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 forms 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.

Source: SIAM Journal on Discrete Mathematics

DOI: 10.1137/20m1319401

Authors: Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen

Institutions: École Normale Supérieure - PSL, University of Bonn

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Deutscher Akademischer Austauschdienst, Agence Nationale de la Recherche

Awards: Algorithmic theory of new data models, Algorithms with Small Separations acKnowledged: graphs and linear matroids