1.
Hanaka T, Kobayashi Y, Kurita K, Lee SW, Otachi Y. Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. AAAI [Internet]. 2022Jun.28 [cited 2024Apr.25];36(4):3758-66. Available from: https://ojs.aaai.org/index.php/AAAI/article/view/20290