![]() | Up a level |
Orlin, James B. and Végh, László A. ORCID: 0000-0003-1152-200X
(2023)
Directed shortest paths via approximate cost balancing.
Journal of the ACM, 70 (1).
ISSN 0004-5411
Orlin, James B. and Végh, László A. ORCID: 0000-0003-1152-200X
(2022)
Directed shortest paths via approximate cost balancing.
In: Marx, Daniel, (ed.)
ACM-SIAM Symposium on Discrete Algorithms, SODA 2021.
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
Association for Computing Machinery, 235 - 254.
ISBN 9781611976465