G. Even, J. (Seffi) Naor, B. Schieber, M. Sudan  Home/Search
Context Related
| eng.tau.ac.il/~guy/Papers/FES.pdf 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: eng.tau.ac.il/~...of_publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback vertex set (FVS) problem, and the weighted feedback edge set (FES) problem. In the FVS (resp. FES) problem, one is given a directed graph with weights (each of which is at least one) on the vertices (resp. edges), and is asked to find a subset of vertices (resp. edges) with minimum total weight that intersects every directed cycle in the graph. These problems are among... (Update)
Cited by: More
Unknown - Fpt Algorithm For (Correct)
FPT Algorithm - For The Undirected (Correct)
An O(2^O(k) n³) FPT Algorithm for the.. - Dehne, Fellows.. (2005) (Correct)
Similar documents (at the sentence level):
49.3%: Approximating Minimum Feedback Sets and Multicuts in.. - Even, Naor, Schieber.. (1998) (Correct)
14.6%: Approximating Minimum Feedback Sets and Multi-Cuts in.. - Even, Naor, Schieber.. (1998) (Correct)
Active bibliography (related documents): More All
0.6: A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005) (Correct)
0.5: Feedback Set Problems - Festa, Pardalos, Resende (1999) (Correct)
0.2: Multicommodity Flows and Approximation Algorithms - Garg (1994) (Correct)
Similar documents based on text: More All
0.6: A Taxonomy of Divide-and-Conquer Approximation Algorithms - Rabani (1995) (Correct)
0.5: Divide-and-Conquer Approximation Algorithms via Spreading.. - Even, Naor, Rao, Schieber (1996) (Correct)
0.3: Approximating Minimum Subset Feedback Sets in.. - Even, Naor, Schieber.. (1996) (Correct)
Related documents from co-citation: More All
414: Code optimization and finite church-rosser systems (context) - Aho, Sethi et al. - 1971
376: Reducibility Among Combinatorial Problems (context) - Karp - 1972
335: Depth first search and linear graph algorithms (context) - Tarjan - 1972
BibTeX entry: (Update)
G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151--174, 1998. http://citeseer.ist.psu.edu/even98approximating.html More
@article{ even98approximating,
author = "Guy Even and Joseph Naor and Baruch Schieber and Madhu Sudan",
title = "Approximating Minimum Feedback Sets and Multicuts in Directed Graphs",
journal = "Algorithmica",
volume = "20",
number = "2",
pages = "151-174",
year = "1998",
url = "citeseer.ist.psu.edu/even98approximating.html" }
Citations (may not include all citations):773 Reducibility among combinatorial problems (context) - Karp - 1972
326 Interior-Point Polynomial Algorithms in Convex Programming (context) - Nesterov, Nemirovskii - 1994
308 Digital Systems Testing and Testable Design (context) - Abramovici, Breuer et al. - 1990
207 Retiming Synchronous Circuitry (context) - Leiserson, Saxe - 1991
168 An approximate max-flow min-cut theorem for uniform multi-co.. (context) - Leighton, Rao - 1992
154 Fast approximation algorithms for fractional packing and cov.. - Plotkin, Shmoys et al. - 1995
74 Divide-and-conquer approximation algorithms via spreading me.. - Even, Naor et al. - 1995
46 cut theorems and their applications (context) - Garg, Vazirani et al. - 1996
43 A parallel approximation algorithm for positive linear progr.. - Luby, Nisan - 1993
42 Packing directed circuits fractionally (context) - Seymour - 1995
41 Multi-commodity network flows (context) - Hu - 1963
22 Approximation algorithms for Steiner and directed multicuts - Klein, Plotkin et al. - 1997
18 An analytical approach to the partial scan problem (context) - Kunzmann, Wunderlich - 1990
15 Primal--dual approximation algorithms for feedback problems .. - Goemans, Williamson - 1996
14 Leighton--Rao might be practical: faster approximation algor.. (context) - Klein, Stein et al. - 1990
14 Finding a minimum feedback arc set in reducible flow graphs (context) - Ramachandran - 1988
13 A minimax theorem for directed graphs (context) - Lucchesi, Younger - 1978
10 BALLAST: a methodology for partial scan design (context) - Gupta, Gupta et al. - 1989
9 The Logical Design of Operating Systems (context) - Shaw - 1974
7 An approximate max-flow min-cut relation for undirected mult.. (context) - Klein, Ravi et al. - 1995
7 Cutting and partitioning a graph after a fixed pattern (context) - Yannakakis, Kanellakis et al. - 1983
2 Problemes Combinatoires et Theorie des Graphes (context) - Frank, Gyarfas et al. - 1976
1 A minimax arc theorem for reducible flow graphs (context) - Ramachandran - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.eng.tau.ac.il/~guy/Papers/list_of_publications.html): More
The Retiming Lemma: A Simple Proof and Applications - Even (Correct)
On Approximating a Geometric Prize-Collecting Traveling.. - Bar-Yehuda, Even, Shahar (2003) (Correct)
Covering Graphs Using Trees and Stars - Even, Garg, Könemann, Ravi, Sinha (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