Algebraic theory on shortest paths for all flows

DOI10.1007/978-3-319-26626-8_55zbMATH Open1473.68129OpenAlexW2396978051MaRDI QIDQ5743545FDOQ5743545

Authors: Tadao Takaoka 

Publication date: 5 February 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_55

Recommendations

• Algebraic theory on shortest paths for all flows
• scientific article; zbMATH DE number 7121921
• Time depending shortest-path problems with applications to railway networks
• A shortest path routing problem with resource allocation
• Variations on the bottleneck paths problem

zbMATH Keywords

information sharinglimited edge costpriority queueshortest path problem for all flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Flows in graphs (05C21) Paths and cycles (05C38) Traffic problems in operations research (90B20)

Cites Work

• Network flows. Theory, algorithms, and applications.
• A note on two problems in connexion with graphs
• Multicriteria Optimization
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• On the single-source unsplittable flow problem
• Shortest paths algorithms: Theory and experimental evaluation
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Approximation algorithms for the unsplittable flow problem
• Algorithms for two bottleneck optimization problems
• On the exponent of all pairs shortest path problem
• Sharing information for the all pairs shortest path problem
• Integer priority queues with decrease key in constant time and the single source shortest paths problem
• Subcubic cost algorithms for the all pairs shortest path problem
• Some extensions of the bottleneck paths problem
• Combining all pairs shortest paths and all pairs bottleneck paths problems

Cited In (1)

• Algebraic theory on shortest paths for all flows

Uses Software

• Algorithm 360

This page was built for publication: Algebraic theory on shortest paths for all flows

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