Results 1  10
of
5,043
On weighted multiway cuts in trees
 MATHEMATICAL PROGRAMMING
, 1994
"... A minmax theorem is developed for the multiway cut problem of edgeweighted trees. We present a polynomial time algorithm to construct an optimal dual solution, if edge weights come in unary representation. Applications to biology also require some more complex edge weights. We describe a dynarnic ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
A minmax theorem is developed for the multiway cut problem of edgeweighted trees. We present a polynomial time algorithm to construct an optimal dual solution, if edge weights come in unary representation. Applications to biology also require some more complex edge weights. We describe a dynarnic
An improved approximation algorithm for multiway cut
 Journal of Computer and System Sciences
, 1998
"... Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due ..."
Abstract

Cited by 74 (5 self)
 Add to MetaCart
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due
Multiway cuts in node weighted graphs
 JOURNAL OF ALGORITHMS
, 2004
"... A (2 — 2/k) approximation algorithm is presented for the node multiway cut problem, thus matching the result of Dahlhaus et al. (SIAM J. Comput. 23 (4) (1994) 864894) for the edge version of this problem. This is done by showing that the associated LPrelaxation always has a halfintegral optimal s ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
A (2 — 2/k) approximation algorithm is presented for the node multiway cut problem, thus matching the result of Dahlhaus et al. (SIAM J. Comput. 23 (4) (1994) 864894) for the edge version of this problem. This is done by showing that the associated LPrelaxation always has a halfintegral optimal
Multiway cuts and spectral clustering
, 2003
"... We look at spectral clustering as optimization. We show that near some special points called perfect, spectral clustering optimizes simultaneously two criteria: a dissimilarity measure that we call the multiway normalized cut (MNCut) and a cluster coherence measure that we call the gap. The immedia ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
We look at spectral clustering as optimization. We show that near some special points called perfect, spectral clustering optimizes simultaneously two criteria: a dissimilarity measure that we call the multiway normalized cut (MNCut) and a cluster coherence measure that we call the gap
1 LP for Multiway cut [1]
"... Last time we set up the following LP for the Multiway cut problem: uv xu − xv 1 · cuv min 1 2 s.t. xi = ei ∑ ∀terminal i j xuj =1 ∀u xu ≥ 0 ..."
Abstract
 Add to MetaCart
Last time we set up the following LP for the Multiway cut problem: uv xu − xv 1 · cuv min 1 2 s.t. xi = ei ∑ ∀terminal i j xuj =1 ∀u xu ≥ 0
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
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
Multiway cut for stereo and motion with slanted surfaces
 In International Conference on Computer Vision
, 1999
"... Slanted surfaces pose a problem for correspondence algorithms utilizing search because of the greatly increased number of possibilities, when compared with frontoparallel surfaces. In this paper we propose an algorithm to compute correspondence between stereo images or between frames of a motionsequ ..."
Abstract

Cited by 137 (2 self)
 Add to MetaCart
motionsequence by minimizingan energy functional that accounts for slanted surfaces. The energy is minimized in a greedy strategy that alternates between segmenting the image into a number of nonoverlapping regions (using the multiwaycut algorithm of Boykov, Veksler, and Zabih) and finding the affine
Multiway Cuts in Directed and Node Weighted Graphs
 in Proc. 21st ICALP, Lecture Notes in Computer Science 820
, 1994
"... this paper we consider node multiway cuts; the problem of computing a minimum weight node multiway cut is known to be NPhard and max SNPhard [1]. It turns out that the approximation algorithm in [2] for edge multiway cuts does not extend to the node multiway cut problem. Let us give a reason for t ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
this paper we consider node multiway cuts; the problem of computing a minimum weight node multiway cut is known to be NPhard and max SNPhard [1]. It turns out that the approximation algorithm in [2] for edge multiway cuts does not extend to the node multiway cut problem. Let us give a reason
Parameterized Tractability of Multiway Cut with Parity Constraints
"... Abstract. In this paper, we study a parity based generalization of the classical MULTIWAY CUT problem. Formally, we study the PARITY MULTIWAY CUT problem, where the input is a graph G, vertex subsets Te and To (T = Te ∪ To) called terminals, a positive integer k and the objective is to test whether ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. In this paper, we study a parity based generalization of the classical MULTIWAY CUT problem. Formally, we study the PARITY MULTIWAY CUT problem, where the input is a graph G, vertex subsets Te and To (T = Te ∪ To) called terminals, a positive integer k and the objective is to test whether
Results 1  10
of
5,043