Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi. Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022. pages 3758-3766, AAAI Press, 2022. [doi]

Authors

Tesshu Hanaka

This author has not been identified. Look up 'Tesshu Hanaka' in Google

Yasuaki Kobayashi

This author has not been identified. Look up 'Yasuaki Kobayashi' in Google

Kazuhiro Kurita

This author has not been identified. Look up 'Kazuhiro Kurita' in Google

See Woo Lee

This author has not been identified. Look up 'See Woo Lee' in Google

Yota Otachi

This author has not been identified. Look up 'Yota Otachi' in Google