Computingk-shortest path lengths in euclidean networks

This publication has 6 references indexed in Scilit:

• Shortest paths in euclidean graphs
  Algorithmica, 1986
• Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau
  Discrete Applied Mathematics, 1986
• Data Structures and Network Algorithms
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1983
• On algorithms for finding the k shortest paths in a network
  Networks, 1979
• Shortest paths with euclidean distances: An explanatory model
  Networks, 1978
• A Formal Basis for the Heuristic Determination of Minimum Cost Paths
  IEEE Transactions on Systems Science and Cybernetics, 1968