Results 11  20
of
826
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
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
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
MultiCut alphabetaPruning in GameTree Search
, 1999
"... The efficiency of the ##algorithm as a minimax search procedure can be attributed to its effective pruning at socalled cutnodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cutnodes by also expa ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The efficiency of the ##algorithm as a minimax search procedure can be attributed to its effective pruning at socalled cutnodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cutnodes by also
MultiCut αβPruning in GameTree Search
 Theoretical Computer Science
, 2001
"... Abstract. The efficiency of the αβalgorithm as a minimax search procedure can be attributed to its effective pruning at socalled cutnodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cutnodes by ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. The efficiency of the αβalgorithm as a minimax search procedure can be attributed to its effective pruning at socalled cutnodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cut
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
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
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
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 NP
Parameterized Complexity Dichotomy for Steiner Multicut (Full Version)
, 2014
"... We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = {T1,..., Tt}, Ti ⊆ V (G), of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that of each set Ti at least one pair of terminals is in diffe ..."
Abstract
 Add to MetaCart
We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = {T1,..., Tt}, Ti ⊆ V (G), of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that of each set Ti at least one pair of terminals
Solving Multicut Faster than 2 n
"... Abstract. In the Multicut problem, we are given an undirected graph G = (V, E) and a family T = {(si, ti)  si, ti ∈ V} of pairs of requests and the objective is to find a minimum sized set S ⊆ V such that every connected component of G \ S contains at most one of si and ti for any pair (si, ti) ∈ ..."
Abstract
 Add to MetaCart
Abstract. In the Multicut problem, we are given an undirected graph G = (V, E) and a family T = {(si, ti)  si, ti ∈ V} of pairs of requests and the objective is to find a minimum sized set S ⊆ V such that every connected component of G \ S contains at most one of si and ti for any pair (si, ti
Results 11  20
of
826