Gruia Calinescu, Howard Karloff, Yuval Rabani  Home/Search
Context
Related
| cs.technion.ac.il/...alinescuKR98.ps.gz iit.edu/~calinesc/stoc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.technion.ac.il/...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 to Dahlhaus, Johnson, Papadimitriou, Seymour, and Yannakakis gave a performance guarantee of 2 i 1 \Gamma 1 k j . In this paper, we present a new linear programming relaxation for Multiway Cut ... (Update)
Similar documents (at the sentence level):
54.1%: An Improved Approximation Algorithm for Multiway Cut - Calinescu, Karloff, Rabani (1998) (Correct)
Active bibliography (related documents): More All
0.5: Approximation Algorithms for the 0-Extension Problem - Calinescu, Karloff, Rabani (2000) (Correct)
0.4: Multicommodity Flows and Approximation Algorithms - Garg (1994) (Correct)
0.3: A lower bound of 8/(7 + 1/(k-1)) on the integrality ratio of.. - Freund, Karloff (2000) (Correct)
Similar documents based on text: More All
0.6: Rounding Algorithms for a Geometric Embedding of.. - Karger, Klein.. (1999) (Correct)
0.6: Multi-way Analysis in the Food Industry - Models, Algorithms, and.. - Bro (Correct)
0.6: Multiway Cuts in Directed and Node Weighted Graphs - Garg, Vazirani, Yannakakais (1994) (Correct)
BibTeX entry: (Update)
@misc{ calinescu-multiway,
author = "Gruia Calinescu and Howard Karloff and Yuval Rabani",
title = "Multiway Cut",
url = "citeseer.ist.psu.edu/176242.html" }
Citations (may not include all citations):518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988 ACM
403 Proof Verification and Hardness of Approximation Problems - Arora, Lund et al. - 1992 DBLP
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1993
303 Princeton University Press (context) - Ford, Fulkerson et al. - 1962
149 Polynomial-time Approximation Schemes for Dense Instances of.. - Arora, Karger et al. - 1995
88 Multiprocessor Scheduling with the Aid of Network Flow Algor.. (context) - Stone - 1977 DBLP
64 The Regularity Lemma and Approximation Schemes for Dense Pro.. (context) - Frieze, Kannan - 1996 ACM DBLP
55 Integer Programming and Network Flows (context) - Hu - 1969
55 The Complexity of Multiway Cuts (context) - Dahlhaus, Johnson et al. - 1983
36 A New Approach to the Minimum Cut Problem - Karger, Stein - 1996 ACM DBLP
34 Computing Near-Optimal Solutions to Combinatorial Optimizati.. - Shmoys - 1995
26 Multiway Cuts in Directed and Node Weighted Graphs - Garg, Vazirani et al. - 1994 ACM DBLP
19 Upper Saddle River (context) - Ahuja, Magnanti et al. - 1993
17 Cuts Within Twice the Optimal (context) - Saran, Vazirani - 1991
13 The Optimal Multiterminal Cut Problem (context) - Cunningham - 1991
11 the Multiway Cut Polyhedron (context) - Chopra, Rao - 1991
10 Polynomial Algorithm for the k-Cut Problem (context) - Goldschmidt, Hochbaum - 1988 DBLP
5 Nonlinear Formulations and Improved Randomized Approximation.. (context) - Bertsimas, Teo et al. - 1995 ACM DBLP
4 Preliminary version appeared in STOC (context) - Garg, Vazirani et al. - 1996
4 On Weighted Multiway Cuts in Trees (context) - Erdos, Sz'ekely - 1994 ACM
4 Algorithm for the Planar 3-Cut Problem (context) - Hochbaum, Shmoys et al. - 1985
4 Preliminary version appeared in STOC (context) - Dahlhaus, Johnson et al. - 1994
4 Approximation Algorithm for the Directed Multiway Cut Proble.. (context) - Naor, Zosin - 1997
2 Extended Formulations for the A-cut Problem (context) - Chopra, Owen - 1994 ACM
Documents on the same site (http://www.cs.technion.ac.il/~rabani/publications.html): More
Universal O(congestion + dilation + log^(1+ε) N).. - Ostrovsky, Rabani (Correct)
Lower Bounds for High Dimensional Nearest Neighbor.. - Borodin, Ostrovsky.. (1999) (Correct)
A Computational View of Population Genetics (preliminary.. - Rabani, Rabinovich.. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC