Computing minimum multiway cuts in hypergraphs
From MaRDI portal
Publication:1799394
DOI10.1016/j.disopt.2013.10.002zbMath1506.05199OpenAlexW2067062892MaRDI QIDQ1799394
Publication date: 18 October 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2013.10.002
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (6)
Minimum Cuts and Sparsification in Hypergraphs ⋮ Global and fixed-terminal cuts in digraphs ⋮ Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ On some algorithmic aspects of hypergraphic matroids ⋮ Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding minimum 3-way cuts in hypergraphs
- Fully-dynamic min-cut
- On the complexity of constructing evolutionary trees
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- A fast hypergraph min-cut algorithm for circuit partitioning
- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
- A new approach to the maximum-flow problem
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A new approach to the minimum cut problem
- A simple min-cut algorithm
- Multiway cuts in node weighted graphs
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- Approximation Algorithms for Submodular Multiway Partition
- A generalization of Kónig's theorem
- Cutsets and partitions of hypergraphs
This page was built for publication: Computing minimum multiway cuts in hypergraphs
