Results 11  20
of
612
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
A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
, 2009
"... Abstract. The MULTICUT IN TREES problem consists in deciding, given a tree, a set of requests (i.e. paths in the tree) and an integer k, whether there exists a set of k edges cutting all the requests. This problem was shown to be FPT by Guo and Niedermeyer in [10]. They also provided an exponential ..."
Abstract
 Add to MetaCart
Abstract. The MULTICUT IN TREES problem consists in deciding, given a tree, a set of requests (i.e. paths in the tree) and an integer k, whether there exists a set of k edges cutting all the requests. This problem was shown to be FPT by Guo and Niedermeyer in [10]. They also provided an exponential
MultiCut Solutions of Laplacian Growth
, 2009
"... A new class of solutions to Laplacian growth (LG) with zero surface tension is presented and shown to contain all other known solutions as special or limiting cases. These solutions, which are timedependent conformal maps with branch cuts inside the unit circle, are governed by a nonlinear integral ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
integral equation and describe oil fjords with nonparallel walls in viscous fingering experiments in HeleShaw cells. Integrals of motion for the multicut LG solutions in terms of singularities of the Schwarz function are found, and the dynamics of densities (jumps) on the cuts are derived. The subclass
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.
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
, and the treewidth tw(G) as constant, parameter, or unbounded, and for all versions of the problem (edge deletion and node deletion with and without deletable terminals), we prove either that the problem is fixedparameter tractable or that the problem is hard (W[1]hard or even (para)NPcomplete). Among the many
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 6 (2 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 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
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
C.: Higherorder segmentation via multicuts
 CoRR abs/1305.6387
"... Multicuts enable to conveniently represent discrete graphical models for unsupervised and supervised image segmentation, based on local energy functions that exhibit symmetries. The basic Potts model and natural extensions thereof to higherorder models provide a prominent class of representatives, ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Multicuts enable to conveniently represent discrete graphical models for unsupervised and supervised image segmentation, based on local energy functions that exhibit symmetries. The basic Potts model and natural extensions thereof to higherorder models provide a prominent class of representatives
Parallel Multicut Segmentation via Dual Decomposition
"... Abstract. We propose a new outer relaxation of the multicut polytope, along with a dual decomposition approach for correlation clustering and multicut segmentation, for general graphs. Each subproblem is a minimum stcut problem and can thus be solved efficiently. An optimal reparameterization is f ..."
Abstract
 Add to MetaCart
Abstract. We propose a new outer relaxation of the multicut polytope, along with a dual decomposition approach for correlation clustering and multicut segmentation, for general graphs. Each subproblem is a minimum stcut problem and can thus be solved efficiently. An optimal reparameterization
Results 11  20
of
612