Parallel asynchronous algorithms for the \(K\) shortest paths problem

DOI10.1023/A:1004676705907zbMath0962.90050OpenAlexW2092090659WikidataQ58921809 ScholiaQ58921809MaRDI QIDQ1973483

Roberto Musmanno, Francesca Guerriero

Publication date: 27 April 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004676705907

zbMATH Keywords

shared memoryparallel asynchronous algorithmslabel-correcting methods\(K\) shortest paths problemsaccess (NUMA) multiprocessornonuniform memory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05)

Related Items (1)

Parallel asynchronous algorithms for the \(K\) shortest paths problem

Uses Software

• NETGEN

Cites Work

• Reliability evaluation of large telecommunication networks
• Parallel asynchronous label-correcting methods for shortest paths
• Parallel asynchronous algorithms for the \(K\) shortest paths problem
• A Class of Label-Correcting Methods for the K Shortest Paths Problem
• Threshold assignment algorithm
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A simple and fast label correcting algorithm for shortest paths
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel asynchronous algorithms for the \(K\) shortest paths problem