A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Longkun Guo, Yunyun Deng, Kewen Liao, Qiang He, Timos Sellis, Zheshan Hu. A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths. In Jérôme Lang, editor, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden. pages 1456-1462, ijcai.org, 2018. [doi]

This author has not been identified. Look up 'Longkun Guo' in GoogleThis author has not been identified. Look up 'Yunyun Deng' in GoogleThis author has not been identified. Look up 'Kewen Liao' in GoogleThis author has not been identified. Look up 'Qiang He' in GoogleThis author has not been identified. Look up 'Timos Sellis' in GoogleThis author has not been identified. Look up 'Zheshan Hu' in Google

runs on WebDSL