On algorithms for minimum-cost quickest paths with multiple delay-bounds

DOI10.1007/978-3-540-24707-4_126MaRDI QIDQ5712484zbMATH OpenOpenAlexFDO

Authors Young-Cheol Bang, Inki Hong, Sung-Chang Lee, Byungjun Ahn

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98048

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints
• Probabilistic quickest path algorithm
• Algorithms for the quickest path problem and the enumeration of quickest paths
• On the computation of fast data transmissions in networks with capacities and delays
• Transmissions in a network with capacities and delays

Cited in

(5)

• Search space reduction in QoS routing.
• Delay-constrained shortest paths: approximation algorithms and second-order cone models
• k-pair delay constrained minimum cost routing in undirected networks
• On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: On algorithms for minimum-cost quickest paths with multiple delay-bounds

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