Publisher
Springer Nature Singapore
Reference21 articles.
1. Baharev A, Schichl H, Neumaier A, Achterberg T (2021) An exact method for the minimum feedback arc set problem. ACM J Exp Algorithm 26:1–28. https://www.mat.univie.ac.at/~neum/ms/minimum_feedback_arc_set.pdf
2. Berger B, Shor PW (1990) Approximation algorithms for the maximum acyclic subgraph problem. In: SODA ’90: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp 236–243. https://dl.acm.org/doi/10.5555/320176.320203
3. Bessy S Bougeret M Krithika R Sahu A Saurabh S Thiebaut J Zehavi M (2021) Packing arc-disjoint cycles in tournaments. Algorithmica 83:1393–1420
4. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, third edn
5. Eades P, Lin X, Smyth W (1993) A fast and effective heuristic for the feedback arc set problem. Inf Process Lett 47(6):319–323