Results 11  20
of
765
Improved Results for Directed Multicut
"... Abstract We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an O( ..."
Abstract
 Add to MetaCart
Abstract We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an O(
Approximating Minimum Multicuts by Evolutionary MultiObjective Algorithms
"... It has been shown that simple evolutionary algorithms are able to solve the minimum cut problem in expected polynomial time when using a multiobjective model of the problem. In this paper, we generalize these ideas to the NPhard minimum multicut problem. Given a set of k terminal pairs, we prove t ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
It has been shown that simple evolutionary algorithms are able to solve the minimum cut problem in expected polynomial time when using a multiobjective model of the problem. In this paper, we generalize these ideas to the NPhard minimum multicut problem. Given a set of k terminal pairs, we prove
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
Approximate maxintegralflow/minmulticut theorems
, 2004
"... We establish several approximate maxintegralflow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where the minmulticut is a constant fraction ɛ of the total capacity of the graph. This setting is motivated by several combina ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We establish several approximate maxintegralflow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where the minmulticut is a constant fraction ɛ of the total capacity of the graph. This setting is motivated by several
Approximation Algorithms for the Bipartite Multicut problem
, 2006
"... We introduce the Bipartite Multicut problem. This is a generalization of the stMincut problem, is similar to the Multicut problem (except for more stringent requirements) and also turns out to be an immediate generalization of the Min UnCut problem. We prove that this problem is NPhard and then ..."
Abstract
 Add to MetaCart
hard and then present LP and SDP based approximation algorithms. While the LP algorithm is based on the GargVaziraniYannakakis algorithm for Multicut, the SDP algorithm uses the Structure Theorem of ℓ 2 2 Metrics. 1
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
Strategic Multiway Cut and Multicut Games
"... We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential infection. For the gametheoretic version of Multiway Cut, we prove that the price of stability is 1, i.e., there exists ..."
Abstract
 Add to MetaCart
a Nash equilibrium as good as the centralized optimum. For the gametheoretic version of Multicut, we show that there exists a 2approximate equilibrium as good as the centralized optimum. We also give polytime algorithms for finding exact and approximate equilibria in these games. 1.
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
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
Directed Multicut with linearly ordered terminals
, 2014
"... Motivated by an application in network security, we investigate the following “linear ” case of Directed Multicut. Let G be a directed graph which includes some distinguished vertices t1,..., tk. What is the size of the smallest edge cut which eliminates all paths from ti to tj for all i < j? We ..."
Abstract
 Add to MetaCart
Motivated by an application in network security, we investigate the following “linear ” case of Directed Multicut. Let G be a directed graph which includes some distinguished vertices t1,..., tk. What is the size of the smallest edge cut which eliminates all paths from ti to tj for all i < j
Results 11  20
of
765