"A Unifying Formalism for Shortest Path Problems with Expensive Edge ..."

Christopher M. Dellin, Siddhartha S. Srinivasa (2016)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2016-06-08

- view
  - electronic edition @ aaai.org
- export record
  dblp key:
  - conf/aips/DellinS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aips/DellinS16
Christopher M. Dellin, Siddhartha S. Srinivasa:
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors. ICAPS 2016: 459-467

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.