Approximation algorithms for the 0-extension problemMulticuts in unweighted graphs with bounded degree and bounded tree-width
