A new approach to the maximum-flow problem
Journal of the ACM (JACM)
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Extended formulations for the A-cut problem
Mathematical Programming: Series A and B
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
Task Allocation on a Network of Processors
IEEE Transactions on Computers
Graph cutting algorithms for distributed applications partitioning
ACM SIGMETRICS Performance Evaluation Review
A 2-Approximation Algorithm for the Directed Multiway Cut Problem
SIAM Journal on Computing
Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design efficient shrinkage techniques which allow to reduce the size of an instance in such a way that optimal solutions are preserved. We design and evaluate a fast local heuristics that yields remarkably good results compared to a well known $2-\frac{2}{k}$ approximation algorithm. The use of the shrinkage criterion allows us to increase the size of the instances solved exactly, or to augments the precision of any particular heuristics.