Finding optimal paths in MREP routing

DOI10.1016/J.IPL.2003.10.005zbMath1178.68678OpenAlexW2044550459MaRDI QIDQ1029048

J. Blot

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.10.005

zbMATH Keywords

computational complexitygraph algorithmsapproximation algorithms

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on practical construction of maximum bandwidth paths.
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Finding optimal paths in MREP routing