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

Authors:
Paola Festa;Panos M. Pardalos;Mauricio G. C. Resende
Affiliations:
University of Salerno, Baronissi (SA), Italy;University of Florida, Gainesville, FL;AT&T Labs Research, Florham Park, NJ
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2001

Citing 4
Cited 2

Feedback vertex sets and cyclically reducible graphs

Journal of the ACM (JACM)
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Node-and edge-deletion NP-complete problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

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

ACM Transactions on Mathematical Software (TOMS)
Applying local search to the feedback vertex set problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose FORTRAN subroutines for approximately solving the feedback vertex and arc set problems on directed graphs using a Greedy Randomized Adaptive Search Procedure (GRASP). Implementation and usage of the package is outlined and computational experiments are reported illustrating solution quality as a function of running time.