Abstract
The parameterized node multiway cut problem is for a given graph to find a separator of size bounded by k whose removal separates a collection of terminal sets in the graph. In this paper, we develop an O(4k n O(1)) time algorithm for this problem, significantly improving the previous algorithm of time \(O(4^{k^3} n^{O(1)})\) for the problem. Our result also gives the first polynomial time algorithm for the minimum node multiway cut problem when the separator size is bounded by O(logn).
This work was supported in part by the National Science Foundation under the Grants CCR-0311590 and CCF-0430683.
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
Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition, pp. 648–655 (1998)
Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. Journal of Computer and System Science 60, 564–574 (2000)
Chartrand, G., Lesniak, L.: Graphs & Digraphs, 2nd edn. The Wadsworth & Brooks/Cole Mathematics Series (1986)
Cong, J., Labio, W., Shivakumar, N.: Multi-way VLSI circuit partitioning based on dual net representation. In: Proc. IEEE International Conference on Computer-Aided Design, pp. 56–62 (1994)
Cunningham, W.: The optimal multiterminal cut problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 5 (1991)
Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23, 864–894 (1994)
Downey, R., Fellows, M.: Parameterized Complexity. In: Monograph in computer science, Springer, Heidelberg (1999)
Ford Jr., L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)
Karger, D., Klein, P., Stein, C., Thorup, M., Young, N.: Rounding algorithms for a geometric embedding of minimum multiway cut. In: Proc. on 31th Annual ACM Syposium on Theory of Computing, pp. 668–678 (1999)
Karger, D., Levine, M.: Finding maximum flows in undirected graphs seems easier than bipartite matching. In: Proc. on 30th Annual ACM Syposium on Theory of Computing, pp. 69–78 (1998)
Marx, D.: Parameterized graph separation problems. Theoretical Computer Science 351, 394–406 (2006)
Naor, J., Zosin, L.: A 2-approximation algorithm for the directed multiway cut problem. SIAM J. Comput. 31, 477–482 (2001)
Stone, H.: Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering 3, 85–93 (1977)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Liu, Y., Lu, S. (2007). An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)