Label-setting Algorithms

Label-Setting Algorithms is a class of shortest path algorithms that iteratively selects and permanently labels the node with the smallest tentative distance, thereby distinguishing itself from label-correcting methods by fixing node distances in non-decreasing order.

56

Publications

3.2K

Citations

153

Authors

95

Institutions

Publications per year

2017–2026

11

Authors

153

  1. FG
    Fred Glover

    University of Colorado Boulder, United States

    3 publications · 409 citations

    3

    h-index

  2. MD
    Michael Drexl

    Johannes Gutenberg University Mainz, Germany

    3 publications · 141 citations

    3

    h-index

  3. EP
    Eric Prescott‐Gagnon

    Polytechnique Montréal, Canada

    3 publications · 141 citations

    3

    h-index

  4. DK
    Darwin Klingman

    The University of Texas at Austin, United States

    3 publications · 409 citations

    3

    h-index

  5. QS
    Qing Song

    Nanyang Technological University, Singapore

    1 publications · 35 citations

    2

    h-index

1–5 of 153

Venues

  1. Networks

    7 publications · 787 citations

    7

    h-index

  2. Transportation Science

    5 publications · 272 citations

    5

    h-index

  3. Journal of Combinatorial Optimization

    2 publications · 106 citations

    3

    h-index

  4. Discrete Applied Mathematics

    2 publications · 83 citations

    2

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 24 citations

    2

    h-index

1–5