"Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm."

Domenico Cantone, Simone Faro (2004)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2004.03.019

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/CantoneF04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/CantoneF04
Domenico Cantone, Simone Faro:
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm. Electron. Notes Discret. Math. 17: 81-86 (2004)

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.