Concepedia

K-shortest Paths

K-Shortest Paths is a computational method in graph theory that extends the shortest path problem by identifying the k distinct shortest simple paths between a pair of vertices in a weighted graph, where k is a specified positive integer.

229

Publications

17K

Citations

527

Authors

269

Institutions

Publications per year

2017–2026

43

Variants

K-shortest Path Problem

Parents

Publications

229

Finding the <i>K</i> Shortest Loopless Paths in a Network

Jin Y. Yen · Management Science · 1971 · 2.6K citations

, , +14

Finding the k Shortest Paths

David Eppstein · SIAM Journal on Computing · 1998 · 1.4K citations

, , +14

Multiple Object Tracking Using K-Shortest Paths Optimization

Jérôme Berclaz, François Fleuret, Engin Türetken et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2011 · 1K citations · Full text

, , +15

The steiner problem in graphs

Stuart E. Dreyfus, Robert A. Wagner · Networks · 1971 · 693 citations

, , +13

Disjoint paths in a network

J. W. Suurballe · Networks · 1974 · 689 citations

, , +14

1–5 of 229

Authors

527

  1. MP
    Marta Pascoal

    University of Coimbra, Portugal

    5 publications · 306 citations

    5

    h-index

  2. LR
    Liam Roditty

    Bar-Ilan University, Israel

    5 publications · 108 citations

    5

    h-index

  3. PB
    Panagiotis Bouros

    Humboldt-Universität zu Berlin, Germany

    4 publications · 163 citations

    4

    h-index

  4. DP
    Daniele Pretolani

    Università di Camerino, Italy

    4 publications · 121 citations

    4

    h-index

  5. TC
    Theodoros Chondrogiannis

    Free University of Bozen-Bolzano, Italy

    4 publications · 163 citations

    4

    h-index

1–5 of 527

Institutions

269

  1. University of California, Berkeley

    Berkeley, United States

    8 h-index

    16 publications

    2.1K citations

  2. University of California, Davis

    Davis, United States

    6 h-index

    11 publications

    530 citations

  3. University of Konstanz

    Konstanz, Germany

    5 h-index

    8 publications

    422 citations

  4. National Central University

    Taoyuan City, Taiwan

    5 h-index

    5 publications

    258 citations

  5. Southeast University

    Nanjing, China

    5 h-index

    11 publications

    176 citations

  6. University of Coimbra

    Coimbra, Portugal

    5 h-index

    11 publications

    947 citations

  7. Imperial College London

    London, United Kingdom

    4 h-index

    9 publications

    615 citations

  8. Stanford University

    Stanford, United States

    4 h-index

    6 publications

    605 citations

1–8 of 269

Venues

  1. Networks

    15 publications · 2.6K citations

    13

    h-index

  2. Computers & Operations Research

    7 publications · 359 citations

    7

    h-index

  3. ACM Transactions on Algorithms

    TALG · 5 publications · 150 citations

    5

    h-index

  4. arXiv (Cornell University)

    Repository · 5 publications · 193 citations

    5

    h-index

  5. European Journal of Operational Research

    4 publications · 126 citations

    4

    h-index

1–5