Hypergraph k-cut for fixed k in deterministic polynomial time

We consider the Hypergraph-k-cut problem. The input consists of a hypergraph G=(V,E) with non-negative hyperedge-costs c: E→ R_+ and a positive integer k. The objective is to find a least-cost subset F⊆ E 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 non-empty sets V_1,V_2,…,V_k 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 (1988). In contrast, it is only recently that a randomized polynomial time algorithm for Hypergraph-k-cut was developed (Chandrasekaran, Xu, Yu, 2018) via a subtle generalization of Karger's random contraction approach for graphs. In this work, we develop the first deterministic polynomial time algorithm for Hypergraph-k-cut for all 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 n^O(k^2) time while the second one runs in n^O(k) time. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2021

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k

We consider the problem of deterministically enumerating all minimum k-c...
research
04/20/2022

Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k

We consider the problem of enumerating optimal solutions for two hypergr...
research
09/10/2020

Near-linear Size Hypergraph Cut Sparsifiers

Cuts in graphs are a fundamental object of study, and play a central rol...
research
08/31/2023

Dually conformal hypergraphs

Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all ...
research
06/20/2020

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs

We address counting and optimization variants of multicriteria global mi...
research
07/17/2023

Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time

We consider hypergraph network design problems where the goal is to cons...
research
01/28/2023

Cut-matching Games for Generalized Hypergraph Ratio Cuts

Hypergraph clustering is a basic algorithmic primitive for analyzing com...

Please sign up or login with your details

Forgot password? Click here to reset