Optimal Path Discovery Problem with Homogeneous Knowledge
- 21 May 2019
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 64 (2) , 227-250
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- FP7 Research infrastructures (610764)
This publication has 22 references indexed in Scilit:
- Query-competitive algorithms for cheapest set problems under uncertaintyTheoretical Computer Science, 2016
- Computing shortest paths with uncertaintyJournal of Algorithms, 2007
- Efficient Update Strategies for Geometric Computing with UncertaintyTheory of Computing Systems, 2005
- On the complexity of the robust spanning tree problem with interval dataOperations Research Letters, 2004
- Computing the Median with UncertaintySIAM Journal on Computing, 2003
- Shortest paths algorithms: Theory and experimental evaluationMathematical Programming, 1996
- Bidirectional Heuristic Search AgainJournal of the ACM, 1983
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958