Algebraic Theory on Shortest Paths for All Flows

DOI10.1007/978-3-319-26626-8_55zbMath1473.68129OpenAlexW2396978051MaRDI QIDQ5743545

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

zbMATH Keywords

priority queueinformation sharinglimited edge costshortest path problem for all flows

Mathematics Subject Classification ID

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

Uses Software

• Algorithm 360

Cites Work

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

This page was built for publication: Algebraic Theory on Shortest Paths for All Flows