Concepedia

Approximation Algorithms For Shortest Paths

Approximation Algorithms for Shortest Paths is an algorithmic approach within shortest path computation that provides near-optimal solutions with provable performance guarantees for problems where exact solutions are computationally expensive or infeasible.

348

Publications

16.7K

Citations

599

Authors

297

Institutions

Publications per year

2017–2026

52

Parents

Publications

348

Approximation Schemes for the Restricted Shortest Path Problem

Refael Hassin · Mathematics of Operations Research · 1992 · 560 citations

, , +10

Fast exact and approximate geodesics on meshes

Vitaly Surazhsky, Tatiana Surazhsky, Danil Kirsanov et al. · ACM Transactions on Graphics · 2005 · 500 citations · Full text

, , +13

Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems

A. R. Warburton · Operations Research · 1987 · 324 citations

, , +16

On the Optimal Robot Routing Problem in Wireless Sensor Networks

Bo Yuan, Shazia Sadiq · IEEE Transactions on Knowledge and Data Engineering · 2007 · 269 citations

, , +16

Approximation algorithms for shortest path motion planning

Kenneth L. Clarkson · 1987 · 262 citations · Full text

, , +11

1–5 of 348

Authors

599

  1. DN
    Danupon Nanongkai

    University of Vienna, Austria

    10 publications · 443 citations

    10

    h-index

  2. PK
    Pankaj K. Agarwal

    Duke University, United States

    10 publications · 272 citations

    10

    h-index

  3. JS
    Joseph S. B. Mitchell

    Stony Brook University, United States

    8 publications · 326 citations

    8

    h-index

  4. AM
    Anil Maheshwari

    Carleton University, Canada

    8 publications · 500 citations

    8

    h-index

  5. SH
    Sariel Har-Peled

    University of Illinois Urbana-Champaign, United States

    7 publications · 232 citations

    7

    h-index

1–5 of 599

Institutions

297

  1. Tel Aviv University

    Tel Aviv, Israel

    13 h-index

    20 publications

    1.2K citations

  2. Duke University

    Durham, United States

    12 h-index

    20 publications

    760 citations

  3. Carnegie Mellon University

    Pittsburgh, United States

    11 h-index

    20 publications

    1.6K citations

  4. Carleton University

    Ottawa, Canada

    11 h-index

    22 publications

    1.4K citations

  5. Massachusetts Institute of Technology

    Cambridge, United States

    10 h-index

    15 publications

    790 citations

  6. University of California, Berkeley

    Berkeley, United States

    9 h-index

    13 publications

    1.2K citations

  7. University of Bonn

    Bonn, Germany

    8 h-index

    11 publications

    639 citations

  8. ETH Zurich

    Zurich, Switzerland

    8 h-index

    15 publications

    372 citations

1–8 of 297

Venues

  1. SIAM Journal on Computing

    19 publications · 1K citations

    17

    h-index

  2. Networks

    11 publications · 453 citations

    10

    h-index

  3. Journal of Combinatorial Optimization

    8 publications · 316 citations

    8

    h-index

  4. Algorithmica

    8 publications · 544 citations

    8

    h-index

  5. arXiv (Cornell University)

    Repository · 8 publications · 224 citations

    8

    h-index

1–5