Increasing the weight of minimum spanning trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum bisection size (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Tree packing and approximating k-cuts
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-cuts via network strength
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Unified Framework for Approximating Multiway Partition Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Synthesizing Distributed Controllers for the Safe Operation of ConnectedSpaces
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On generalized greedy splitting algorithms for multiway partition problems
Discrete Applied Mathematics
A divide-and-merge methodology for clustering
ACM Transactions on Database Systems (TODS)
Minimum cost subpartitions in graphs
Information Processing Letters
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Algorithms for the balanced edge partitioning problem
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Improving the scalability of data center networks with traffic-aware virtual machine placement
INFOCOM'10 Proceedings of the 29th conference on Information communications
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Parallel implementations of gusfield's cut tree algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Approximation algorithms for requirement cut on graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Cut problems in graphs with a budget constraint
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
An improved approximation algorithm for requirement cut
Operations Research Letters
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
Sum-Max graph partitioning problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Computer Networks: The International Journal of Computer and Telecommunications Networking
A derandomized approximation algorithm for the critical node detection problem
Computers and Operations Research
Joint virtual machine assignment and traffic engineering for green data center networks
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
Two simple approximation algorithms for the minimum $k$-cut problem are presented. Each algorithm finds a $k$ cut having weight within a factor of $(2-2/k)$ of the optimal. One of our algorithms is particularly efficient---it requires a total of only $n-1$ maximum flow computations for finding a set of near-optimal $k$ cuts, one for each value of $k$ between 2 and $n$.