Combinatorial algorithms for feedback problems in directed graphs

Information Processing Letters

Volumn 86, Issue 3, 2003, Pages 129-136

  Demetrescu, Camil ^a   Finocchi, Irene ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Approximation algorithms; Combinatorial optimization; Directed graphs; Feedback problems

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; FEEDBACK; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS;

PROBLEM SOLVING;

EID: 0037449037     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00491-X     Document Type: Article

References (23)

1. Bafna V., Berman P., Fujito T. Constant ratio approximations of the weighted feedback vertex set problem. Proceedings of the 6th International Symposium on Algorithms and Computation (ISAAC'95). Lecture Notes in Comput. Sci. 1004:1995;142-151 Springer, Berlin.
2. Bar-Yehuda R. One for the price of two: A unified approach for approximating covering problems. Proceedings of the 1st Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'98). 1998;49-62.
3. Bar-Yehuda R., Even S. A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25:1985;27-46.
4. Bar-Yehuda R., Geiger D., Naor J.S., Roth R.M. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput. 27:(4):1998;942-959.
5. Becker A., Geiger D. Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the feedback vertex set problem. Artificial Intelligence. 83:1996;167-188.
6. Berger B., Shor P.W. Approximation algorithms for the maximum acyclic subgraph problem. Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. 1990;236-243.
7. Demetrescu C., Finocchi I. Break the "right" cycles and get the "best" drawing. Moret B.E., Goldberg A.V. Proceedings of the 2nd International Workshop on Algorithm Engineering and Experiments (ALENEX'00). 2000;171-182. See also http://www.dsi.uniroma1.it/̃finocchi/experim/cplib-2.0/index.html.
8. 2) barrier. Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00). 2000;381-389.
9. Eades P., Lin X. A new heuristic for the feedback arc set problem. Australian J. Combin. 12:1995;15-26.
10. Eades P., Lin X., Smyth W.F. A fast and effective heuristic for the feedback arc set problem. Inform. Process. Lett. 47:(6):1993;319-323.
11. Even G., Naor J., Rao S., Schieber B. Divide-and-conquer approximation algorithms via spreading metrics. Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science. 1995;62-71.
12. Flood M.M. Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem. Networks. 20:1990;1-23.
13. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to Theory of NP-completeness. 1979;W.H. Freeman, New York.
14. Gavril F. Some NP-complete problems on graphs. Proceedings of the 11th Conference on Information Sciences and Systems. 1977;91-95.
15. Hassin R., Rubinstein S. Approximations for the maximum acyclic subgraph problem. Inform. Process. Lett. 51:1994;133-140.
16. Hochbaum D.S. Approximations Algorithms for NP-Hard Problems. 1997;Thomson Publishing Company.
17. V. Kann, On the approximability of NP-complete optimization problems, PhD thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1992.
18. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum Press, New York.
19. Lempel A., Cederbaum I. Minimum feedback arc and vertex sets of a directed graph. IEEE Trans. Circuit Theory. 13:(4):1966;399-403.
20. C.L. Lucchesi, A minimax equality for directed graphs, PhD thesis, University of Waterloo, 1966.
21. B. Schwikowski and E. Speckenmeyer, On computing all minimal solutions for feedback problems, Technical report, Universität zu Köln, 1997.
22. Seymour P.D. Packing directed circuits fractionally. Combinatorica. 15:1995;281-288.
23. Sugiyama K., Tagawa S., Toda M. Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11:(2):1981;109-125.