Abstract: Highlights•Simulated annealing and greedy algorithms that obtain small directed feedback vertex sets.•Initial pre-processing of the graph into SCCs.•Study of the Poly-APX-Complete nature of the problem.•Design of appropriate efficient data structures.•Extensive experimental results.