Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs

06/20/2020
by   Calvin Beideman, et al.
0

We address counting and optimization variants of multicriteria global min-cut and size-constrained min-k-cut in hypergraphs. 1. For an r-rank n-vertex hypergraph endowed with t hyperedge-cost functions, we show that the number of multiobjective min-cuts is O(r2^trn^3t-1). In particular, this shows that the number of parametric min-cuts in constant rank hypergraphs for a constant number of criteria is strongly polynomial, thus resolving an open question by Aissi, Mahjoub, McCormick, and Queyranne (Math Programming, 2015). In addition, we give randomized algorithms to enumerate all multiobjective min-cuts and all pareto-optimal cuts in strongly polynomial-time. 2. We also address node-budgeted multiobjective min-cuts: For an n-vertex hypergraph endowed with t vertex-weight functions, we show that the number of node-budgeted multiobjective min-cuts is O(r2^rn^t+2), where r is the rank of the hypergraph, and the number of node-budgeted b-multiobjective min-cuts for a fixed budget-vector b is O(n^2). 3. We show that min-k-cut in hypergraphs subject to constant lower bounds on part sizes is solvable in polynomial-time for constant k, thus resolving an open problem posed by Queyranne. Our technique also shows that the number of optimal solutions is polynomial. All of our results build on the random contraction approach of Karger (SODA, 1993). Our techniques illustrate the versatility of the random contraction approach to address counting and algorithmic problems concerning multiobjective min-cuts and size-constrained k-cuts in hypergraphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
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
09/25/2020

Hypergraph k-cut for fixed k in deterministic polynomial time

We consider the Hypergraph-k-cut problem. The input consists of a hyperg...
research
11/16/2020

Faster connectivity in low-rank hypergraphs via expander decomposition

We design an algorithm for computing connectivity in hypergraphs which r...
research
08/22/2023

Simple and Faster Algorithms for Knapsack

In this paper, we obtain a number of new simple pseudo-polynomial time a...
research
02/14/2023

Advances on Strictly Δ-Modular IPs

There has been significant work recently on integer programs (IPs) min{c...
research
02/28/2020

Improved Algorithm for Min-Cuts in Distributed Networks

In this thesis, we present fast deterministic algorithm to find small cu...

Please sign up or login with your details

Forgot password? Click here to reset