A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract)

Eyal Weiss 0001. A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract). In Roman Barták, Wheeler Ruml, Oren Salzman, editors, Sixteenth International Symposium on Combinatorial Search, SOCS 2023, July 14-16, 2023, Prague, Czech Republic. pages 206-207, AAAI Press, 2023. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: