2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) (2014)

Philadelphia, PA, USA

Oct. 18, 2014 to Oct. 21, 2014

ISSN: 0272-5428

ISBN: 978-1-4799-6517-5

pp: 276-285

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2014.37

ABSTRACT

We propose polynomial-time algorithms that sparsify planar and bounded-genus graphs while preserving optimal or near-optimal solutions to Steiner problems. Our main contribution is a polynomial-time algorithm that, given an unweighted graph G embedded on a surface of genus g and a designated face f bounded by a simple cycle of length k, uncovers a set F in E(G) of size polynomial in g and k that contains an optimal Steiner tree for any set of terminals that is a subset of the vertices of f. We apply this general theorem to prove that: -- given an unweighted graph G embedded on a surface of genus g and a terminal set S in V(G), one can in polynomial time find a set F in E(G) that contains an optimal Steiner tree T for S and that has size polynomial in g and |E(T)|; -- an analogous result holds for an optimal Steiner forest for a set S of terminal pairs, -- given an unweighted planar graph G and a terminal set S in V(G), one can in polynomial time find a set F in E(G) that contains an optimal (edge) multiway cut C separating S (i.e., a cutset that intersects any path with endpoints in different terminals from S) and has size polynomial in |C|. In the language of parameterized complexity, these results imply the first polynomial kernels for Steiner Tree and Steiner Forest on planar and bounded-genus graphs (parameterized by the size of the tree and forest, respectively) and for (Edge) Multiway Cut on planar graphs (parameterized by the size of the cutset). Steiner Tree and similar "subset" problems were identified in [Demaine, Hajiaghayi, Computer J., 2008] as important to the quest to widen the reach of the theory of bidimensionality ([Demaine et al., JACM 2005], [Fomin et al., SODA 2010]). Therefore, our results can be seen as a leap forward to achieve this broader goal. Additionally, we obtain a weighted variant of our main contribution: a polynomial-time algorithm that, given an edge-weighted planar graph G, a designated face f bounded by a simple cycle of weight w(f), and an accuracy parameter &epsi; > 0, uncovers a set F in E(G) of total weight at most poly(1/&epsi;) w(f) that, for any set of terminal pairs that lie on f, contains a Steiner forest within additive error &epsi; w(f) from the optimal Steiner forest. This result deepens the understanding of the recent framework of approximation schemes for network design problems on planar graphs ([Klein, SICOMP 2008], [Borradaile, Klein, Mathieu, ACM TALG 2009], and later works) by explaining the structure of the solution space within a brick of the so-called mortar graph -- the central notion of this framework.

INDEX TERMS

Steiner trees, Polynomials, Kernel, Face, Approximation algorithms, Vegetation, Algorithm design and analysis,parameterized algorithms, Planar graphs, Steiner Tree, Steiner Forest, (Edge) Multiway Cut, polynomial kernel

CITATION

Marcin Pilipczuk,
Michal Pilipczuk,
Piotr Sankowski,
Erik Jan van Leeuwen,
"Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs",

*2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS)*, vol. 00, no. , pp. 276-285, 2014, doi:10.1109/FOCS.2014.37SEARCH