BDD-Constrained A* Search: A Fast Method for Solving Constrained Shortest-Path Problems
Lists
Only you see this
Abstract
This paper deals with the constrained DAG shortest path problem (CDSP), which finds the shortest path on a given directed acyclic graph (DAG) under an …
BibTeX
@article{takeuchi2017bdd,
author = {Fumito Takeuchi and Masaaki Nishino and Norihito Yasuda and Takuya Akiba and Shin-ichi Minato and Masaaki Nagata},
title = {{BDD-Constrained A* Search: A Fast Method for Solving Constrained Shortest-Path Problems}},
journal = {IEICE Trans. Information and Systems},
year = {2017},
url = {https://openreview.net/forum?id=YG5pkbgbaFc},
}Loading related content...