An Improved Approximation Algorithm for MULTIWAY CUT
- 1 June 2000
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 60 (3) , 564-574
- https://doi.org/10.1006/jcss.1999.1687
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994
- On weighted multiway cuts in treesMathematical Programming, 1994
- The optimal multiterminal cut problemPublished by American Mathematical Society (AMS) ,1991
- On the multiway cut polyhedronNetworks, 1991
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut ProblemSIAM Journal on Algebraic Discrete Methods, 1985
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977