Approximating the Weighted Minimum Label $s$-$t$ Cut Problem

Peng Zhang

In the weighted (minimum) {\sf Label $s$-$t$ Cut} problem, we are given a (directed or undirected) graph $G=(V,E)$, a label set $L=\{{\ell }_1,{\ell }_2,\dots ,{\ell }_q\}$ with positi…