Publisher
Springer International Publishing
Reference25 articles.
1. Ambainis, A., Balodis, K., Iraids, J., Kokainis, M., Prusis, K., Vihrovs, J.: Quantum speedups for exponential-time dynamic programming algorithms. In: SODA ’19: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1783–1793. Society for Industrial and Applied Mathematics (2019)
2. Baharev, A., Schichl, H., Neumaier, A., Achterberg, T.: An exact method for the minimum feedback arc set problem. ACM J. Exp. Algorithm. 26, 1–28 (2021)
3. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer. London (2002)
4. Berger, B., Shor, P.W.: Approximation algorithms for the maximum acyclic subgraph problem. In: SODA ’90: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 236–243. Society for Industrial and Applied Mathematics (1990)
5. Chen, J., Liu, Y., Lu, S., O’sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5), 1–19 (2008)