Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP

ACM Transactions on Mathematical Software

Volumn 27, Issue 4, 2001, Pages 456-464

  Festa, Paola ^a   Pardalos, Panos M ^b   Resende, Mauricio G C ^c  

^a UNIVERSITY OF SALERNO   (Italy)

^b J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithms; Combinatorial optimization; G.1.6 Numerical Analysis : Optimization Integer programming; G.2.1 Discrete Mathematics : Combinatorics Combinatorial algorithms; G.M Mathematics of Computing : Miscellaneous; Performance

Indexed keywords

EID: 0040027544     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/504210.504214     Document Type: Article

References (13)

1. BAR-YEHUDA, R., GEIGER, D., NAOR, J., AND ROTH, R. M. 1998. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput. 27, 942-959.
2. EVEN, G., NAOR, S., SCHIEBER, B., AND SUDAN, M. 1998. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 151-174.
3. FEO, T. AND RESENDE, M. G. C. 1989. A probabilistic heuristic for a computationally difficult set covering problem. Op. Res. Lett. 8, 67-71.
4. FEO, T. A. AND RESENDE, M. G. C. 1995. Greedy randomized adaptive search procedures. J. Global Opt. 6, 109-133.
5. FESTA, P., PARDALOS, P. M., AND RESENDE, M. G. C. 1999. Feedback set problems. In Handbook of Combinatorial Optimization. Kluwer Academic Publishers, Supplement vol. A, 209-259.
6. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and intractability - A guide to the theory of NP-completeness. W.H. Freeman and Company.
7. KARP, R. M. 1972. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher Eds., Complexity Of Computer Computations, Plenum Press, 85-103.
8. LEIGHTON, T. AND RAO, S. 1988. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 422-431.
9. PARDALOS, P. M., QIAN, T., AND RESENDE, M. G. C. 1999. A greedy randomized adaptive search procedure for feedback vertex set. J. Comb. Opt. 2, 399-412.
10. SEYMOUR, P. 1995. Packing directed circuits fractionally. Combinatorics 15, 281-288.
11. SHAMIR, A. 1979. A linear time algorithm for finding minimum cutsets in reduced graphs. SIAM J. Comput. 8, 645-655.
12. WANG, C., LLOYD, E., AND SOFFA, M. 1985. Feedback vertex sets and cyclically reducible graphs. JACM 32, 296-313.
13. YANNAKAKIS, M. 1978. Node and edge-deletion NP-complete problems. In Proceedings of the 10-th Annual ACM Symposium on Theory of Computing (1978), 253-264.