Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Finding $k$ Cuts within Twice the Optimal
SIAM Journal on Computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
An improved approximation algorithm for multiway cut
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of 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
A note on formulations for the A-partition problem on hypergraphs
Discrete Applied Mathematics - Special volume on VLSI
A linear time 2 + &&egr; approximation algorithm for edge connectivity
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
We present a simple and unified framework for developing and analyzing approximation algorithms for some multiway partition problems (with or without terminals), including the k-way cut (or k- cut), multiterminal cut (or multiway cut), hypergraph partition and target split.