Abstract
In the Multicut problem, we are given an undirected graph G=(V,E) and a family Γ = {(si ti)|osi, ti ε V}f pairs of requests and the objective is to find a minimum sized set S⊆V such that every connected component of G/S contains at most one of si and t i for any pair (si, ti) ε Γ. In this paper we give the first non-trivial algorithm for Multicut running in time O(1.987n). © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Lokshtanov, D., Saurabh, S., & Suchý, O. (2014). Solving Multicut faster than 2 n. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8737 LNCS, pp. 666–676). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
