Shortest Path Algorithms

Shortest Path Algorithms is a class of path-planning algorithms that, given a weighted graph or otherwise discretized representation of an environment, systematically compute a feasible path between specified start and goal states that minimizes a prescribed cost function such as distance, time, or energy.

8.2K

Publications

505.1K

Citations

15.8K

Authors

3.2K

Institutions

Publications per year

2017–2026

1.9K

Authors

15.8K

  1. GL
    Gilbert Laporte

    HEC Montréal, Canada

    36 publications · 6.8K citations

    30

    h-index

  2. JS
    Joseph S. B. Mitchell

    Stony Brook University, United States

    40 publications · 3.5K citations

    27

    h-index

  3. BG
    Bruce Golden

    University of Maryland, College Park, United States

    27 publications · 3.1K citations

    23

    h-index

  4. SK
    Sven Koenig

    University of Southern California, United States

    30 publications · 2.3K citations

    21

    h-index

  5. MT
    Mikkel Thorup

    AT&T (United States), United States

    24 publications · 2.6K citations

    21

    h-index

1–5 of 15.8K

Venues

  1. European Journal of Operational Research

    269 publications · 27K citations

    83

    h-index

  2. Computers & Operations Research

    184 publications · 14.1K citations

    67

    h-index

  3. Networks

    145 publications · 13.3K citations

    55

    h-index

  4. SIAM Journal on Computing

    101 publications · 11.6K citations

    52

    h-index

  5. Transportation Science

    63 publications · 7.1K citations

    41

    h-index

1–5