Finding minimum 3-way cuts in hypergraphs

Authors:
Mingyu Xiao
Affiliations:
University of Electronic Science and Technology of China, Chengdu 610054, PR China
Venue:
Information Processing Letters
Year:
2010

Citing 15
Cited 1

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
A polynomial algorithm for the k-cut problem for fixed k

Mathematics of Operations Research
A new approach to the minimum cut problem

Journal of the ACM (JACM)
A simple min-cut algorithm

Journal of the ACM (JACM)
Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A fast hypergraph min-cut algorithm for circuit partitioning

Integration, the VLSI Journal
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Deterministic Algorithm for Finding All Minimum $k$-Way Cuts

SIAM Journal on Computing
Minimum k-way cuts via deterministic greedy tree packing

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Finding minimum 3-way cuts in hypergraphs

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A new and improved algorithm for the 3-cut problem

Operations Research Letters

Submodular cost allocation problem and applications

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I

Quantified Score

Hi-index	0.89

Visualization

Abstract

The minimum 3-way cut problem in an edge-weighted hypergraph is to find a partition of the vertices into 3 nonempty sets minimizing the total weight of hyperedges that have at least two endpoints in two different sets. In this paper we show that a minimum 3-way cut in hypergraphs can be found by using O(n^3) hypergraph minimum (s,t) cut computations, where n is the number of vertices in the hypergraph. Our simple algorithm is the first polynomial-time algorithm for finding minimum 3-way cuts in hypergraphs.