Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/corr/DellinS16
%A Dellin, Christopher M.
%A Srinivasa, Siddhartha S.
%D 2016
%J CoRR
%K dblp
%T A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors.
%U http://dblp.uni-trier.de/db/journals/corr/corr1603.html#DellinS16
%V abs/1603.03490
@article{journals/corr/DellinS16,
added-at = {2018-08-13T00:00:00.000+0200},
author = {Dellin, Christopher M. and Srinivasa, Siddhartha S.},
biburl = {https://www.bibsonomy.org/bibtex/2ac44c611efa77e1f0a1c33b1f36a47c2/dblp},
ee = {http://arxiv.org/abs/1603.03490},
interhash = {1bf8c7551ca6bfb7750b07c26809f3b5},
intrahash = {ac44c611efa77e1f0a1c33b1f36a47c2},
journal = {CoRR},
keywords = {dblp},
timestamp = {2018-08-14T12:14:10.000+0200},
title = {A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors.},
url = {http://dblp.uni-trier.de/db/journals/corr/corr1603.html#DellinS16},
volume = {abs/1603.03490},
year = 2016
}