Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
Proceedings of the 7th 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
A Unified Framework for Approximating Multiway Partition Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On generalized greedy splitting algorithms for multiway partition problems
Discrete Applied Mathematics
Minimum cost subpartitions in graphs
Information Processing Letters
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Finding minimum 3-way cuts in hypergraphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Finding minimum 3-way cuts in hypergraphs
Information Processing Letters
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
Operations Research Letters
Hi-index | 0.00 |