Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
- 1 November 2024
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 49 (4) , 2579-2601
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Approximating k-cuts using network strength as a Lagrangean relaxationEuropean Journal of Operational Research, 2008
- A Deterministic Algorithm for Finding All Minimum k‐Way CutsSIAM Journal on Computing, 2007
- Cutting Up Is Hard To DoElectronic Notes in Theoretical Computer Science, 2003
- Minimum cuts in near-linear timeJournal of the ACM, 2000
- Computing All Small Cuts in an Undirected NetworkSIAM Journal on Discrete Mathematics, 1997
- On the number of small cuts in a graphInformation Processing Letters, 1996
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Minimizing submodular functions over families of setsCombinatorica, 1995
- Finding k Cuts within Twice the OptimalSIAM Journal on Computing, 1995
- Cutsets and partitions of hypergraphsNetworks, 1973