Results 11  20
of
5,043
On a bidirected relaxation for the Multiway Cut problem
, 2005
"... Abstract In the Multiway Cut problem, we are given an undirected edgeweighted graph G = (V; E) with ce 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 termin ..."
Abstract
 Add to MetaCart
Abstract In the Multiway Cut problem, we are given an undirected edgeweighted graph G = (V; E) with ce 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
SDP gaps and UGC hardness for multiway cut, . . .
"... The connection between integrality gaps and computational hardness of discrete optimization problems is an intriguing question. In recent years, this connection has prominently figured in several tight UGCbased hardness results. We show in this paper a direct way of turning integrality gaps into ha ..."
Abstract
 Add to MetaCart
into hardness results for several fundamental classification problems. Specifically, we convert linear programming integrality gaps for the Multiway Cut, 0Extension and Metric Labeling problems into UGCbased hardness results. Qualitatively, our result suggests that if the unique games conjecture is true
MultiMultiway Cut Problem on Graphs of Bounded Branch Width
"... Abstract. The MultiMultiway Cut problem proposed by Avidor and Langberg[2] is a natural generalization of Multicut and Multiway Cut problems. That is, given a simple graphG and c sets of vertices S1, · · · , Sc, the problem asks for a minimum set of edges whose removal disconnects every pair of ..."
Abstract
 Add to MetaCart
Abstract. The MultiMultiway Cut problem proposed by Avidor and Langberg[2] is a natural generalization of Multicut and Multiway Cut problems. That is, given a simple graphG and c sets of vertices S1, · · · , Sc, the problem asks for a minimum set of edges whose removal disconnects every pair
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
, 2009
"... Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected components. We present an algorithm for this problem which runs in strongly polynomialtime if both the specified number of conne ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected components. We present an algorithm for this problem which runs in strongly polynomialtime if both the specified number
FixedParameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
"... Given a directed graph G, a set of k terminals and an integer p, the DIRECTED VERTEX MULTIWAY CUT problem asks if there is a set S of at most p (nonterminal) vertices whose removal disconnects each terminal from all other terminals. DIRECTED EDGE MULTIWAY CUT is the analogous problem where S is a se ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
Given a directed graph G, a set of k terminals and an integer p, the DIRECTED VERTEX MULTIWAY CUT problem asks if there is a set S of at most p (nonterminal) vertices whose removal disconnects each terminal from all other terminals. DIRECTED EDGE MULTIWAY CUT is the analogous problem where S is a
A Polynomialtime Approximation Scheme for Planar Multiway Cut
"... Given an undirected graph with edge lengths and a subset of nodes (called the terminals), a multiway cut (also called a multiterminal cut) problem asks for a subset of edges with minimum total length and whose removal disconnects each terminal from the others. It generalizes the min stcut problem ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), a multiway cut (also called a multiterminal cut) problem asks for a subset of edges with minimum total length and whose removal disconnects each terminal from the others. It generalizes the min stcut problem
Multiway Cut, Pairwise Realizable Distributions, and Descending Thresholds [Extended Abstract]
"... We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013]. We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al. [2013] and design a modification that improves the approximation to ..."
Abstract
 Add to MetaCart
We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013]. We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al. [2013] and design a modification that improves the approximation
Simplex Partitioning via Exponential Clocks and the Multiway Cut Problem (Extended Abstract)
, 2013
"... The MultiwayCut problem is a fundamental graph partitioning problem in which the objective is to find a minimum weight set of edges disconnecting a given set of special vertices called terminals. This problem is NPhard and there is a well known geometric relaxation in which the graph is embedded i ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The MultiwayCut problem is a fundamental graph partitioning problem in which the objective is to find a minimum weight set of edges disconnecting a given set of special vertices called terminals. This problem is NPhard and there is a well known geometric relaxation in which the graph is embedded
Results 11  20
of
5,043