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
Parents
56
Roman Dial, Fred Glover, D. Karney et al. · Networks · 1979 · 224 citations
The on-line shortest path problem under partial monitoring
András György, Tamás Linder, Gábor Lugosi et al. · ArXiv.org · 2007 · 158 citations · Full text
1–5 of 56
153
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 153
95

Centre National de la Recherche Scientifique
Paris, France
4 h-index
5 publications
146 citations
Fraunhofer Center for Applied Research on Supply Chain Services
Nuremberg, Germany
3 h-index
3 publications
141 citations

Polytechnique Montréal
Montreal, Canada
3 h-index
7 publications
367 citations
Group for Research in Decision Analysis
Montreal, Canada
3 h-index
5 publications
254 citations
University of Colorado Boulder
Boulder, United States
3 h-index
3 publications
409 citations
The University of Texas at Austin
Austin, United States
3 h-index
5 publications
594 citations

Cornell University
Ithaca, United States
3 h-index
3 publications
80 citations

Czech Technical University in Prague
Prague, Czechia
2 h-index
4 publications
140 citations
1–8 of 95
7 publications · 787 citations
7
h-index
5 publications · 272 citations
5
h-index
2 publications · 106 citations
3
h-index
2 publications · 83 citations
2
h-index
Repository · 1 publications · 24 citations
2
h-index
1–5