Parallel asynchronous algorithms for the K shortest paths problem

DOI10.1023/A:1004676705907MaRDI QIDQ1973483zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Parallel asynchronous label-correcting methods for shortest paths
• Finding the \(k\) shortest paths in parallel
• Finding the \(k\) shortest paths in parallel
• A Class of Label-Correcting Methods for the K Shortest Paths Problem

Cites work

• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• A Class of Label-Correcting Methods for the K Shortest Paths Problem
• A simple and fast label correcting algorithm for shortest paths
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Parallel asynchronous algorithms for the K shortest paths problem
• Parallel asynchronous label-correcting methods for shortest paths
• Reliability evaluation of large telecommunication networks
• Threshold assignment algorithm

Cited in

(8)

• Shared-memory parallel frontier-based search
• scientific article; zbMATH DE number 6452892 (Why is no real title available?)
• Finding the \(k\) shortest paths in parallel
• Finding the \(k\) shortest paths in parallel
• A Class of Label-Correcting Methods for the K Shortest Paths Problem
• Temporal shortest paths: Parallel computing implementations
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
• Parallel asynchronous algorithms for the K shortest paths problem

Describes a project that uses

Uses Software

• NETGEN

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1973483)