Title of article
On a bidirected relaxation for the MULTIWAY CUT problem Original Research Article
Author/Authors
Chandra Chekuri، نويسنده , , Anupam Gupta، نويسنده , , Amit Kumar، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
13
From page
67
To page
79
Abstract
In the MULTIWAY CUT problem, we are given an undirected edge-weighted graph image with image denoting the cost (weight) of edge e. We are also given a subset S of V, of size k, called the terminals. The objective is to find a minimum cost set of edges whose removal ensures that the terminals are disconnected.
Keywords
Bidirected relaxation , MULTIWAY CUT problem , Integrality gap , Approximation algorithm
Journal title
Discrete Applied Mathematics
Serial Year
2005
Journal title
Discrete Applied Mathematics
Record number
886124
Link To Document