Hypergraph k-cut in randomized polynomial time
Authors:
- 13 November 2019
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 186 (1-2) , 85-113
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CCF-1526799, CCF-1319376)
- National Science Foundation (CCF-1907937)
This publication has 27 references indexed in Scilit:
- Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular SystemsAlgorithmica, 2010
- Finding minimum 3-way cuts in hypergraphsInformation Processing Letters, 2010
- SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUESParallel Processing Letters, 2007
- A Deterministic Algorithm for Finding All Minimum k‐Way CutsSIAM Journal on Computing, 2007
- A Divide-and-Conquer Approach to the Minimum k -Way Cut ProblemAlgorithmica, 2002
- A fast hypergraph min-cut algorithm for circuit partitioningIntegration, 2000
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Recent directions in netlist partitioning: a surveyIntegration, 1995
- Finding k Cuts within Twice the OptimalSIAM Journal on Computing, 1995
- Cutsets and partitions of hypergraphsNetworks, 1973