TY - GEN
T1 - Computing Diverse Shortest Paths Efficiently
T2 - 36th AAAI Conference on Artificial Intelligence, AAAI 2022
AU - Hanaka, Tesshu
AU - Kobayashi, Yasuaki
AU - Kurita, Kazuhiro
AU - Lee, See Woo
AU - Otachi, Yota
N1 - Funding Information:
The authors thank anonymous referees for valuable comments. This work is partially supported by JSPS Kakenhi Grant Numbers JP18H04091, JP18K11168, JP18K11169, JP19H01133, JP20H05793, JP20K19742, JP21H03499, JP21K11752, JP21K17707 JP21H05852 JP21K17812, and JST CREST Grant Number JPMJCR18K3.
Publisher Copyright:
Copyright © 2022, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2022/6/30
Y1 - 2022/6/30
N2 - Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study the following type of problems: given an integer k, the problem asks for k solutions such that the sum of pairwise (weighted) Hamming distances between these solutions is maximized. Such solutions are called diverse solutions. We present a polynomial-time algorithm for finding diverse shortest stpaths in weighted directed graphs. Moreover, we study the diverse version of other classical combinatorial problems such as diverse weighted matroid bases, diverse weighted arborescences, and diverse bipartite matchings. We show that these problems can be solved in polynomial time as well. To evaluate the practical performance of our algorithm for finding diverse shortest st-paths, we conduct a computational experiment with synthetic and real-world instances. The experiment shows that our algorithm successfully computes diverse solutions within reasonable computational time.
AB - Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study the following type of problems: given an integer k, the problem asks for k solutions such that the sum of pairwise (weighted) Hamming distances between these solutions is maximized. Such solutions are called diverse solutions. We present a polynomial-time algorithm for finding diverse shortest stpaths in weighted directed graphs. Moreover, we study the diverse version of other classical combinatorial problems such as diverse weighted matroid bases, diverse weighted arborescences, and diverse bipartite matchings. We show that these problems can be solved in polynomial time as well. To evaluate the practical performance of our algorithm for finding diverse shortest st-paths, we conduct a computational experiment with synthetic and real-world instances. The experiment shows that our algorithm successfully computes diverse solutions within reasonable computational time.
UR - http://www.scopus.com/inward/record.url?scp=85137652164&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85137652164&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85137652164
T3 - Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022
SP - 3758
EP - 3766
BT - AAAI-22 Technical Tracks 4
PB - Association for the Advancement of Artificial Intelligence
Y2 - 22 February 2022 through 1 March 2022
ER -