scientific article; zbMATH DE number 7121921

DOI10.4230/OASIcs.ATMOS.2015.56zbMath1432.90031MaRDI QIDQ5240196

Tadao Takaoka

Publication date: 24 October 2019

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

priority queueinformation sharinglimited edge costtransportation networkshortest path problem for all flows

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18)

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
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• 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
• Fibonacci heaps and their uses in improved network optimization 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: