Results 1  10
of
1,256
Approximating the kMulticut Problem
"... We study the kmulticut problem: Given an edgeweighted undirected graph, a set of l pairs of vertices, and a target k ≤ l, find the minimum cost set of edges whose removal disconnects at least k pairs. This generalizes the well known multicut problem, where k = l. We show that the kmulticut problem ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
We study the kmulticut problem: Given an edgeweighted undirected graph, a set of l pairs of vertices, and a target k ≤ l, find the minimum cost set of edges whose removal disconnects at least k pairs. This generalizes the well known multicut problem, where k = l. We show that the kmulticut
Abstract Approximating the kMulticut Problem
"... We study the kmulticut problem: Given an edgeweighted undirected graph, a set of l pairs of vertices, and a target k ≤ l, find the minimum cost set of edges whose removal disconnects at least k pairs. This generalizes the well known multicut problem, where k = l. We show that the kmulticut problem ..."
Abstract
 Add to MetaCart
We study the kmulticut problem: Given an edgeweighted undirected graph, a set of l pairs of vertices, and a target k ≤ l, find the minimum cost set of edges whose removal disconnects at least k pairs. This generalizes the well known multicut problem, where k = l. We show that the kmulticut
Treewidth reduction for the parameterized Multicut problem
, 2010
"... The parameterized Multicut problem consists in deciding, given a graph, a set of requests (i.e. pairs of vertices) and an integer k, whether there exists a set of k edges which disconnects the two endpoints of each request. Determining whether Multicut is FixedParameter Tractable with respect to k ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The parameterized Multicut problem consists in deciding, given a graph, a set of requests (i.e. pairs of vertices) and an integer k, whether there exists a set of k edges which disconnects the two endpoints of each request. Determining whether Multicut is FixedParameter Tractable with respect to k
On Reducing the Cut Ratio to the Multicut Problem
, 1993
"... We compare two multicommodity flow problems, the maximum sum of flow, and the maximum concurrent flow. We show that, for a given graph and a given set of k commodities with specified demands, if the minimum capacity of a multicut is approximated by the maximum sum of flow within a factor of alpha, f ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We compare two multicommodity flow problems, the maximum sum of flow, and the maximum concurrent flow. We show that, for a given graph and a given set of k commodities with specified demands, if the minimum capacity of a multicut is approximated by the maximum sum of flow within a factor of alpha
On reducing the cut ratio to the multicut problem
"... We compare two multicommodity flow problems, the maximum sum of flow, and the maximum concurrent flow. We show that, for a given graph and a given set of k commodities with specified demands, if the minimum capacity of a multicut is approximated by the maximum sum of flow within a factor of ff, for ..."
Abstract
 Add to MetaCart
We compare two multicommodity flow problems, the maximum sum of flow, and the maximum concurrent flow. We show that, for a given graph and a given set of k commodities with specified demands, if the minimum capacity of a multicut is approximated by the maximum sum of flow within a factor of ff
Approximation Algorithms for Feasible Cut and Multicut Problems
, 1995
"... Let G = (V; E) be an undirected graph with a capacity function u : E!!+ and let S 1 ; S 2 ; : : : ; S k be k commodities, where each S i consists of a pair of nodes. A set X of nodes is called feasible if it contains no S i , and a cut (X; X) is called feasible if X is feasible. Several optimizatio ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
optimization problems on feasible cuts are shown to be NP hard. A 2approximation algorithm for the minimumcapacity feasible v cut problem is presented. The multicut problem is to find a set of edges F ` E of minimum capacity such that no connected component of G n F contains a commodity S i
Analysis of LP relaxations for multiway and multicut problems
 M.C. COSTA ET AL. / EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
, 1999
"... We introduce in this paper an exact nonlinear formulation of the multiway cut problem. By simple linearizations of this formulation, we derive several wellknown and new formulations for the problem. We further establish a connection between the multiway cut and the maximumweighted independent set ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We introduce in this paper an exact nonlinear formulation of the multiway cut problem. By simple linearizations of this formulation, we derive several wellknown and new formulations for the problem. We further establish a connection between the multiway cut and the maximumweighted independent
Nonlinear formations and improved randomized algorithms for multiway and multicut problems
, 1995
"... We introduce nonlinear formulations of the multiway cut and multicut problems. By simple linearizations of these formulations we derive several well known formulations and valid inequalities as well as several new ones. Through these formulations we establish a connection between the multiway cut an ..."
Abstract
 Add to MetaCart
We introduce nonlinear formulations of the multiway cut and multicut problems. By simple linearizations of these formulations we derive several well known formulations and valid inequalities as well as several new ones. Through these formulations we establish a connection between the multiway cut
Edge disjoint paths and multicut problems in graphs generalizing the trees
, 2005
"... We generalize all the results obtained for maximum integer multiflow and minimum multicut problems in trees by Garg et al. [Primaldual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 (1997) 3–20] to graphs with a fixed cyclomatic number, while this cannot be achieve ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We generalize all the results obtained for maximum integer multiflow and minimum multicut problems in trees by Garg et al. [Primaldual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 (1997) 3–20] to graphs with a fixed cyclomatic number, while this cannot
Constant ratio fixedparameter approximation of the edge multicut problem
 In ESA 2009
, 2009
"... Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1},..., {sm, tm}; the task is to remove a minimum set of edges such that si and ti are disconnected for every 1 ≤ i ≤ m. The parameterized complexity of the problem, parameterized by the ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1},..., {sm, tm}; the task is to remove a minimum set of edges such that si and ti are disconnected for every 1 ≤ i ≤ m. The parameterized complexity of the problem, parameterized
Results 1  10
of
1,256