@COMMENT This file was generated by bib2html.pl <https://sourceforge.net/projects/bib2html/> version 0.94
@COMMENT written by Patrick Riley <http://sourceforge.net/users/patstg/>
@COMMENT This file came from Gal A. Kaminka's publication pages at
@COMMENT http://www.cs.biu.ac.il/~galk/publications/
@inproceedings{ecai23,
 author = {Eyal Weiss and Ariel Felner and Gal A. Kaminka},
 title = {A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates},
 booktitle = ECAI, 
 year = {2023},
 pages= {2607--2614},
  wwwnote = {An earlier version was published at the RDDPS workshop at ICAPS 2023 conference.},
  abstract = {  The shortest path problem in graphs is a cornerstone of AI theory and applications. 
   Existing algorithms generally ignore edge weight computation time. 
   We present a generalized framework for weighted directed graphs, where edge weight can be computed (estimated) multiple times, at increasing accuracy and run-time expense. 
   This raises several generalized variants of the shortest path problem.
   We introduce the problem of finding a path with the tightest lower-bound on the optimal cost. 
   We then present two complete algorithms for the generalized problem, and empirically demonstrate their efficacy.
  },
}