Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
We consider the Hypergraph-k-Cut problem. The input consists of a hypergraph [Formula: see text] with nonnegative hyperedge-costs [Formula: see text] and a positive integer k. The objective is to find a minimum cost subset [Formula: see text] such that the number of connected components in G – F is at least k. An alternative formulation of the objective is to find a partition of V into k nonempty sets [Formula: see text] so as to minimize the cost of the hyperedges that cross the partition. Graph-k-Cut, the special case of Hypergraph-k-Cut obtained by restricting to graph inputs, has received considerable attention. Several different approaches lead to a polynomial-time algorithm for Graph-k-Cut when k is fixed, starting with the work of Goldschmidt and Hochbaum (Math of OR, 1994). In contrast, it is only recently that a randomized polynomial time algorithm for Hypergraph-k-Cut was developed (Chandrasekaran, Xu, Yu, Math Programming, 2019) via a subtle generalization of Karger’s random contraction approach for graphs. In this work, we develop the first deterministic algorithm for Hypergraph-k-Cut that runs in polynomial time for any fixed k. We describe two algorithms both of which are based on a divide and conquer approach. The first algorithm is simpler and runs in [Formula: see text] time while the second one runs in [Formula: see text] time, where n is the number of vertices and m is the number of hyperedges in the input hypergraph. Our proof relies on new structural results that allow for efficient recovery of the parts of an optimum k-partition by solving minimum (S,T)-terminal cuts. Our techniques give new insights even for Graph-k-Cut.
We consider the Hypergraph-k-Cut problem. The input consists of a hypergraph [Formula: see text] with nonnegative hyperedge-costs [Formula: see text] and a positive integer k. The objective is to find a minimum cost subset [Formula: see text] such that the number of connected components in G – F is at least k. An alternative formulation of the objective is to find a partition of V into k nonempty sets [Formula: see text] so as to minimize the cost of the hyperedges that cross the partition. Graph-k-Cut, the special case of Hypergraph-k-Cut obtained by restricting to graph inputs, has received considerable attention. Several different approaches lead to a polynomial-time algorithm for Graph-k-Cut when k is fixed, starting with the work of Goldschmidt and Hochbaum (Math of OR, 1994). In contrast, it is only recently that a randomized polynomial time algorithm for Hypergraph-k-Cut was developed (Chandrasekaran, Xu, Yu, Math Programming, 2019) via a subtle generalization of Karger’s random contraction approach for graphs. In this work, we develop the first deterministic algorithm for Hypergraph-k-Cut that runs in polynomial time for any fixed k. We describe two algorithms both of which are based on a divide and conquer approach. The first algorithm is simpler and runs in [Formula: see text] time while the second one runs in [Formula: see text] time, where n is the number of vertices and m is the number of hyperedges in the input hypergraph. Our proof relies on new structural results that allow for efficient recovery of the parts of an optimum k-partition by solving minimum (S,T)-terminal cuts. Our techniques give new insights even for Graph-k-Cut.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.