Fixed parameter approximation scheme for min-max k-cut
- 16 June 2022
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 197 (2) , 1093-1144
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CCF-1814613, CCF-1907937)
This publication has 26 references indexed in Scilit:
- Approximating k-cuts using network strength as a Lagrangean relaxationEuropean Journal of Operational Research, 2008
- Greedy splitting algorithms for approximating multiway partition problemsMathematical Programming, 2004
- Min-Max Multiway Cut2004
- Cutting Up Is Hard To DoElectronic Notes in Theoretical Computer Science, 2003
- Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions ApproachJournal of Algorithms, 1996
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Finding k Cuts within Twice the OptimalSIAM Journal on Computing, 1995
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994
- A Polynomial Algorithm for the k-cut Problem for Fixed kMathematics of Operations Research, 1994
- Cutsets and partitions of hypergraphsNetworks, 1973