Multiway cuts in node weighted graphs

Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
<span title="">2004</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Journal of Algorithms</a> </i> &nbsp;
A (2 -2/k) approximation algorithm is presented for the node multiway cut problem, thus matching the result of Dahlhaus et al. (SIAM J. Comput. 23 (4) (1994) 864-894) for the edge version of this problem. This is done by showing that the associated LP-relaxation always has a half-integral optimal solution.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/s0196-6774(03)00111-1</a> <a target="_blank" rel="external noopener" href="">fatcat:jxfpih7nezhebbrj5q7p2bcxzq</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>