Finding optimal paths in MREP routing

DOI10.1016/J.IPL.2003.10.005MaRDI QIDQ1029048zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmscomputational complexitygraph algorithms

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• Minimum-energy broadcasting in static ad hoc wireless networks
• Approximating energy efficient paths in wireless multi-hop networks
• The energy-constrained quickest path problem

Cites work

• A note on practical construction of maximum bandwidth paths.
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(2)

• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• A biobjective optimization model for routing in mobile ad hoc networks

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

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