From Static Code Distribution to More Shrinkage for the Multiterminal Cut

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− 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.

• Type: Conference
• Year: 2005
• Where: WEA
• Authors: Bram De Wachter, Alexandre Genon, Thierry Massart
• Keywords: Algorithms, Efficient Shrinkage Techniques, Fast Local Heuristics, Multiterminal Cut Problem, WEA 2005