Label-correcting Algorithms
Label-Correcting Algorithms is a class of shortest path algorithms that iteratively refine distance labels associated with nodes in a graph until optimal shortest path distances are achieved, distinguished from label-setting methods by allowing tentative labels to be updated multiple times based on incoming relaxation steps.
57
Publications
2.4K
Citations
158
Authors
95
Institutions
Publications per year
2017–2026
14
Parents
57
A simple and fast label correcting algorithm for shortest paths
Dimitri P. Bertsekas · Networks · 1993 · 117 citations · Full text
Identifying and Correcting Label Bias in Machine Learning
Heinrich Jiang, Ofir Nachum · arXiv (Cornell University) · 2019 · 116 citations · Full text
1–5 of 57
158
3
h-index
Massachusetts Institute of Technology, United States
3 publications · 235 citations
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 158
95

University of Calabria
Rende, Italy
3 h-index
4 publications
243 citations
University of Iowa
Iowa City, United States
2 h-index
3 publications
41 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
3 publications
69 citations
Erasmus University Rotterdam
Rotterdam, The Netherlands
2 h-index
3 publications
84 citations
Northwestern University
Evanston, United States
2 h-index
4 publications
124 citations
Google (United States)
Mountain View, United States
2 h-index
3 publications
168 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
171 citations
Decision Systems (United States)
Northbrook, United States
2 h-index
3 publications
223 citations
1–8 of 95
8 publications · 449 citations
8
h-index
TRR · 3 publications · 74 citations
3
h-index
3 publications · 233 citations
3
h-index
Repository · 2 publications · 156 citations
2
h-index
Repository · 1 publications · 27 citations
1
h-index
1–5