Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakais  Home/Search
Context Related
| mpisb.mpg.de/~naveen/publ...node.ps.gz 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: mpisb.mpg.de/~naveen/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we consider node multiway cuts; the problem of computing a minimum weight node multiway cut is known to be NP-hard and max SNP-hard [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 this. Define an isolating cut for terminal s i to be a cut that separates s i from the rest of the terminals. A minimum isolating cut for s i can be computed in polynomial time by identifying the... (Update)
Cited by: More
Wavelength Conversion in Shortest-Path All-Optical Networks - Erlebach, Stefanakos (2003) (Correct)
A Generalization of Totally Unimodular and Network Matrices - Kotnyek (2002) (Correct)
Dynamic QoS-Aware Multimedia Service Configuration in.. - Gu, Nahrstedt (2002) (Correct)
Similar documents (at the sentence level):
49.7%: Multicommodity Flows and Approximation Algorithms - Garg (1994) (Correct)
Active bibliography (related documents): More All
0.2: Improved Bounds on the Max-Flow Min-Cut Ratio for.. - Plotkin, Tardos (1993) (Correct)
0.2: Divide-and-Conquer Approximation Algorithms via Spreading.. - Even, Naor, Rao, Schieber (1996) (Correct)
0.1: Multiway Cut - Calinescu, Karloff, Rabani (1998) (Correct)
Similar documents based on text: More All
1.5: An Improved Approximation Algorithm for Multiway Cut - Calinescu, Karloff, Rabani (1998) (Correct)
0.5: Multi-way Analysis in the Food Industry - Models, Algorithms, and.. - Bro (Correct)
0.4: Approximation Algorithms for the 0-Extension Problem - Calinescu, Karloff, Rabani (Correct)
Related documents from co-citation: More All
8: The complexity of multiway cuts (context) - Dahlhaus, Johnson et al. - 1992
7: Computing Near-Optimal Solutions to Combinatorial Optimization Problems - Shmoys - 1995
6: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
N. Garg, V. V. Vazirani, and M. Yannakakis, \Multiway Cuts in Directed and Node Weighted Graphs," manuscript. Preliminary version appeared in Proc. 21 st ICALP, Lecture Notes in Computer Science 820, Springer-Verlag, 1994, 487-498. http://citeseer.ist.psu.edu/garg94multiway.html More
@inproceedings{ garg94multiway,
author = "Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis",
title = "Multiway Cuts in Directed and Node Weighted Graphs",
booktitle = "Automata, Languages and Programming",
pages = "487-498",
year = "1994",
url = "citeseer.ist.psu.edu/garg94multiway.html" }
Citations (may not include all citations):55 The complexity of multiway cuts (context) - Dahlhaus, Johnson et al. - 1992
17 cuts within twice the optimal (context) - Saran, Vazirani - 1990
10 Polynomial algorithm for the k-cut problem (context) - Goldschmidt, Hochbaum - 1988
7 Cutting and partitioning a graph after a fixed pattern (context) - Yannakakis, Kanellakis et al. - 1983
4 Bounds on the max-flow min-cut ratio for directed multicommo.. - Klein, Plotkin et al. - 1993
1 A feedback edge set in a directed graph is a set of edges su.. (context) - Cunningham, multiterminal et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-sb.mpg.de/~naveen/): More
Finding Separator Cuts in Planar Graphs Within Twice the.. - Garg, Saran, Vazirani (1994) (Correct)
On the Single-Source Unsplittable Flow Problem - Dinitz, Garg, Goemans (1998) (Correct)
Multicommodity Flows and Approximation Algorithms - Garg (1994) (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