Abstract
Given an edge-weighted undirected graph and a list of k source-sink pairs of vertices, the well-known minimum multicut problem consists in selecting a minimum-weight set of edges whose removal leaves no path between every source and its corresponding sink. We give the first polynomial-time algorithm to solve this problem in planar graphs, when k is fixed. Previously, this problem was known to remain NP-hard in general graphs with fixed k, and in trees with arbitrary k; the most noticeable tractable case known so far was in planar graphs with fixed k and sources and sinks lying on the outer face.
This research work was supported by the French ANR project DOPAGE (ANR-09-JCJC-0068).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bateni, M., Hajiaghayi, M., Klein, P., Mathieu, C.: A polynomial-time approximation scheme for planar multiway cut. In: 23th SODA (2012)
Bentz, C.: Résolution exacte et approchée de problèmes de multiflot entier et de multicoupe: algorithmes et complexité. PhD Thesis, CNAM, Paris (2006) (in French)
Bentz, C.: On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discrete Applied Mathematics 156, 1908–1917 (2008)
Bentz, C.: A simple algorithm for multicuts in planar graphs with outer terminals. Discrete Applied Mathematics 157, 1959–1964 (2009)
Bentz, C.: New results on planar and directed multicuts. In: EUROCOMB 2009 (2009); Electronic Notes in Discrete Mathematics, vol. 34, pp. 207–211 (2009)
Cǎlinescu, G., Fernandes, C.G., Reed, B.: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms 48, 333–359 (2003)
Cheung, K., Harvey, K.: Revisiting a simple algorithm for the planar multiterminal cut problem. Operations Research Letters 38, 334–336 (2010)
Colin de Verdière, E., Erickson, J.: Tightening non-simple paths and cycles on surfaces. In: 17th SODA, pp. 192–201 (2006)
Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. on Computing 23, 864–894 (1994)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3–20 (1997)
Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European Journal of Operational Research 186, 542–553 (2008)
Hartvigsen, D.: The planar multiterminal cut problem. Discrete Applied Mathematics 85, 203–222 (1998)
Klein, P.N., Marx, D.: Solving Planar k -Terminal Cut in \(O(n^{c \sqrt{k}})\) Time. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 569–580. Springer, Heidelberg (2012)
Marx, D.: A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 677–688. Springer, Heidelberg (2012)
Schrijver, A.: Homotopic routing methods. In: Korte, B., Lovasz, L., Prömel, H.J., Schrijver, A. (eds.) Paths, Flows and VLSI-Layout. Algorithms and Combinatorics, vol. 9, pp. 329–371. Springer, Berlin (1990)
Schrijver, A.: Disjoint Homotopic Paths and Trees in a Planar Graph. Discrete & Computational Geometry 6, 527–574 (1991)
Yannakakis, M., Kanellakis, P., Cosmadakis, S., Papadimitriou, C.: Cutting and Partitioning a Graph After a Fixed Pattern. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 712–722. Springer, Heidelberg (1983)
Yeh, W.-C.: A simple algorithm for the planar multiway cut problem. Journal of Algorithms 39, 68–77 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bentz, C. (2012). A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs. In: Thilikos, D.M., Woeginger, G.J. (eds) Parameterized and Exact Computation. IPEC 2012. Lecture Notes in Computer Science, vol 7535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33293-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-33293-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33292-0
Online ISBN: 978-3-642-33293-7
eBook Packages: Computer ScienceComputer Science (R0)