Combinatorial algorithms for feedback problems in directed graphs

Given a weighted directed graph G = (V, A), the minimum feedback arc set problem consists of finding a minimum weight set of arcs A' ⊆ A such that the directed graph (V, A \ A') is acyclic. Similarly, the minimum feedback vertex set problem consists of finding a minimum weight set of vertices containing at least one vertex for each directed cycle. Both problems are NP-complete. We present simple combinatorial algorithms for these problems that achieve an approximation ratio bounded by the length, in terms of number of arcs, of a longest simple cycle of the digraph.

[1]  A. Lempel,et al.  Minimum Feedback Arc and Vertex Sets of a Directed Graph , 1966 .

[2]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[3]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[4]  Giuseppe F. Italiano,et al.  Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Benno Schwikowski,et al.  On Computing All Minimal Solutions for Feedback Problems , 1997 .

[6]  Xuemin Lin,et al.  A Fast and Effective Heuristic for the Feedback Arc Set Problem , 1993, Inf. Process. Lett..

[7]  Bonnie Berger,et al.  Approximation alogorithms for the maximum acyclic subgraph problem , 1990, SODA '90.

[8]  Dan Geiger,et al.  Optimization of Pearl's Method of Conditioning and Greedy-Like Approximation Algorithms for the Vertex Feedback Set Problem , 1996, Artif. Intell..

[9]  Joseph Naor,et al.  Divide-and-conquer approximation algorithms via spreading metrics , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[10]  Camil Demetrescu,et al.  Break the "Right" Cycles and Get the "Best" Drawing , 2000 .

[11]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[12]  Reuven Bar-Yehuda,et al.  Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference , 1998, SIAM J. Comput..

[13]  Bruce A. Reed,et al.  Packing directed circuits , 1996, Comb..

[14]  Piotr Berman,et al.  Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs , 1995, ISAAC.

[15]  Reuven Bar-Yehuda,et al.  One for the Price of Two: a Unified Approach for Approximating Covering Problems , 1998, Algorithmica.

[16]  Xuemin Lin,et al.  A heuristic for the feedback arc set problem , 1995, Australas. J Comb..

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[20]  Refael Hassin,et al.  Approximations for the Maximum Acyclic Subgraph Problem , 1994, Inf. Process. Lett..

[21]  Paul D. Seymour,et al.  Packing directed circuits fractionally , 1995, Comb..

[22]  Merrill M. Flood,et al.  Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem , 1990, Networks.