Parallel shortest path auction algorithms

DOI10.1016/0167-8191(94)90035-3zbMath0823.68086OpenAlexW2059616758MaRDI QIDQ1339234

L. C. Polymenakos, Dimitri P. Bertsekas

Publication date: 29 October 1995

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(94)90035-3

zbMATH Keywords

auction algorithmshortest path problemsshared memory machine

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Parallel asynchronous label-correcting methods for shortest paths ⋮ Efficient parallel algorithms for the minimum cost flow problem ⋮ Auction algorithms for network flow problems: A tutorial introduction

This page was built for publication: Parallel shortest path auction algorithms