"Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited ..."

Theodoros Chondrogiannis et al. (2017)

> Home

Details and statistics

DOI: 10.5441/002/EDBT.2017.37

access: open

type: Conference or Workshop Paper

metadata version: 2021-01-29

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/edbt/ChondrogiannisB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/edbt/ChondrogiannisB17
Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser:
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. EDBT 2017: 414-425

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.