The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Rounding algorithms for a geometric embedding of minimum multiway cut
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An improved approximation algorithm for MULTIWAY CUT
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
A 2-approximation algorithm for the directed multiway cut problem
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An 8-approximation algorithm for the subset feedback vertex set problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Parameterized graph separation problems
Theoretical Computer Science - Parameterized and exact computation
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms (TALG)
Note: A simple algorithm for multicuts in planar graphs with outer terminals
Discrete Applied Mathematics
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximation algorithms for k-hurdle problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Better vaccination strategies for better people
Proceedings of the 11th ACM conference on Electronic commerce
Algorithms for multiterminal cuts
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Submodular cost allocation problem and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Enumerating minimal subset feedback vertex sets
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On isolating points using disks
ESA'11 Proceedings of the 19th European conference on Algorithms
Further research on node based bottleneck improvement problem for multicut
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Computing minimum multiway cuts in hypergraphs from hypertree packings
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Restricted vertex multicut on permutation graphs
Discrete Applied Mathematics
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Sparse WiFi deployment for vehicular internet access with bounded interconnection gap
IEEE/ACM Transactions on Networking (TON)
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An o *(1.84 k) parameterized algorithm for the multiterminal cut problem
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
An O*(1.84k) parameterized algorithm for the multiterminal cut problem
Information Processing Letters
| Hi-index | 0.00 |
A (2 - 2/k) approximation algorithm is presented for the node multiway cut problem, thus matching the result of Dahlhaus et al. (SIAM J. Comput. 23 (4) (1994) 864-894) for the edge version of this problem. This is done by showing that the associated LP-relaxation always has a half-integral optimal solution.