609 research outputs found

    Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism

    Get PDF
    In this paper we design {\sf FPT}-algorithms for two parameterized problems. The first is \textsc{List Digraph Homomorphism}: given two digraphs GG and HH and a list of allowed vertices of HH for every vertex of GG, the question is whether there exists a homomorphism from GG to HH respecting the list constraints. The second problem is a variant of \textsc{Multiway Cut}, namely \textsc{Min-Max Multiway Cut}: given a graph GG, a non-negative integer \ell, and a set TT of rr terminals, the question is whether we can partition the vertices of GG into rr parts such that (a) each part contains one terminal and (b) there are at most \ell edges with only one endpoint in this part. We parameterize \textsc{List Digraph Homomorphism} by the number ww of edges of GG that are mapped to non-loop edges of HH and we give a time 2O(logh+2log)n4logn2^{O(\ell\cdot\log h+\ell^2\cdot \log \ell)}\cdot n^{4}\cdot \log n algorithm, where hh is the order of the host graph HH. We also prove that \textsc{Min-Max Multiway Cut} can be solved in time 2O((r)2logr)n4logn2^{O((\ell r)^2\log \ell r)}\cdot n^{4}\cdot \log n. Our approach introduces a general problem, called {\sc List Allocation}, whose expressive power permits the design of parameterized reductions of both aforementioned problems to it. Then our results are based on an {\sf FPT}-algorithm for the {\sc List Allocation} problem that is designed using a suitable adaptation of the {\em randomized contractions} technique (introduced by [Chitnis, Cygan, Hajiaghayi, Pilipczuk, and Pilipczuk, FOCS 2012]).Comment: An extended abstract of this work will appear in the Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC), Patras, Greece, September 201

    Parameterized Complexity Dichotomy for Steiner Multicut

    Get PDF
    The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt \subseteq V(G) of size at most p, and an integer k, whether there is a set S of at most k edges or nodes s.t. of each set Ti at least one pair of terminals is in different connected components of G \ S. This problem generalizes several graph cut problems, in particular the Multicut problem (the case p = 2), which is fixed-parameter tractable for the parameter k [Marx and Razgon, Bousquet et al., STOC 2011]. We provide a dichotomy of the parameterized complexity of Steiner Multicut. That is, for any combination of k, t, p, and the treewidth tw(G) as constant, parameter, or unbounded, and for all versions of the problem (edge deletion and node deletion with and without deletable terminals), we prove either that the problem is fixed-parameter tractable or that the problem is hard (W[1]-hard or even (para-)NP-complete). We highlight that: - The edge deletion version of Steiner Multicut is fixed-parameter tractable for the parameter k+t on general graphs (but has no polynomial kernel, even on trees). We present two proofs: one using the randomized contractions technique of Chitnis et al, and one relying on new structural lemmas that decompose the Steiner cut into important separators and minimal s-t cuts. - In contrast, both node deletion versions of Steiner Multicut are W[1]-hard for the parameter k+t on general graphs. - All versions of Steiner Multicut are W[1]-hard for the parameter k, even when p=3 and the graph is a tree plus one node. Hence, the results of Marx and Razgon, and Bousquet et al. do not generalize to Steiner Multicut. Since we allow k, t, p, and tw(G) to be any constants, our characterization includes a dichotomy for Steiner Multicut on trees (for tw(G) = 1), and a polynomial time versus NP-hardness dichotomy (by restricting k,t,p,tw(G) to constant or unbounded).Comment: As submitted to journal. This version also adds a proof of fixed-parameter tractability for parameter k+t using the technique of randomized contraction

    Multi-Budgeted Directed Cuts

    Get PDF
    In this paper, we study multi-budgeted variants of the classic minimum cut problem and graph separation problems that turned out to be important in parameterized complexity: Skew Multicut and Directed Feedback Arc Set. In our generalization, we assign colors 1,2,...,l to some edges and give separate budgets k_1,k_2,...,k_l for colors 1,2,...,l. For every color i in {1,...,l}, let E_i be the set of edges of color i. The solution C for the multi-budgeted variant of a graph separation problem not only needs to satisfy the usual separation requirements (i.e., be a cut, a skew multicut, or a directed feedback arc set, respectively), but also needs to satisfy that |C cap E_i| <= k_i for every i in {1,...,l}. Contrary to the classic minimum cut problem, the multi-budgeted variant turns out to be NP-hard even for l = 2. We propose FPT algorithms parameterized by k=k_1 +...+ k_l for all three problems. To this end, we develop a branching procedure for the multi-budgeted minimum cut problem that measures the progress of the algorithm not by reducing k as usual, by but elevating the capacity of some edges and thus increasing the size of maximum source-to-sink flow. Using the fact that a similar strategy is used to enumerate all important separators of a given size, we merge this process with the flow-guided branching and show an FPT bound on the number of (appropriately defined) important multi-budgeted separators. This allows us to extend our algorithm to the Skew Multicut and Directed Feedback Arc Set problems. Furthermore, we show connections of the multi-budgeted variants with weighted variants of the directed cut problems and the Chain l-SAT problem, whose parameterized complexity remains an open problem. We show that these problems admit a bounded-in-parameter number of "maximally pushed" solutions (in a similar spirit as important separators are maximally pushed), giving somewhat weak evidence towards their tractability

    On weighted multiway cuts in trees

    Get PDF

    Complexity of Discrete Energy Minimization Problems

    Full text link
    Discrete energy minimization is widely-used in computer vision and machine learning for problems such as MAP inference in graphical models. The problem, in general, is notoriously intractable, and finding the global optimal solution is known to be NP-hard. However, is it possible to approximate this problem with a reasonable ratio bound on the solution quality in polynomial time? We show in this paper that the answer is no. Specifically, we show that general energy minimization, even in the 2-label pairwise case, and planar energy minimization with three or more labels are exp-APX-complete. This finding rules out the existence of any approximation algorithm with a sub-exponential approximation ratio in the input size for these two problems, including constant factor approximations. Moreover, we collect and review the computational complexity of several subclass problems and arrange them on a complexity scale consisting of three major complexity classes -- PO, APX, and exp-APX, corresponding to problems that are solvable, approximable, and inapproximable in polynomial time. Problems in the first two complexity classes can serve as alternative tractable formulations to the inapproximable ones. This paper can help vision researchers to select an appropriate model for an application or guide them in designing new algorithms.Comment: ECCV'16 accepte

    Directed Multicut with linearly ordered terminals

    Full text link
    Motivated by an application in network security, we investigate the following "linear" case of Directed Mutlicut. Let GG be a directed graph which includes some distinguished vertices t1,,tkt_1, \ldots, t_k. What is the size of the smallest edge cut which eliminates all paths from tit_i to tjt_j for all i<ji < j? We show that this problem is fixed-parameter tractable when parametrized in the cutset size pp via an algorithm running in O(4ppn4)O(4^p p n^4) time.Comment: 12 pages, 1 figur

    Fixed-parameter tractability of multicut parameterized by the size of the cutset

    Get PDF
    Given an undirected graph GG, a collection {(s1,t1),...,(sk,tk)}\{(s_1,t_1),..., (s_k,t_k)\} of pairs of vertices, and an integer pp, the Edge Multicut problem ask if there is a set SS of at most pp edges such that the removal of SS disconnects every sis_i from the corresponding tit_i. Vertex Multicut is the analogous problem where SS is a set of at most pp vertices. Our main result is that both problems can be solved in time 2O(p3)...nO(1)2^{O(p^3)}... n^{O(1)}, i.e., fixed-parameter tractable parameterized by the size pp of the cutset in the solution. By contrast, it is unlikely that an algorithm with running time of the form f(p)...nO(1)f(p)... n^{O(1)} exists for the directed version of the problem, as we show it to be W[1]-hard parameterized by the size of the cutset
    corecore