Complexity results on labeled shortest path problems from wireless routing metrics

DOI10.1016/J.COMNET.2009.04.012MaRDI QIDQ2270086zbMATH OpenOpenAlexFDO

Authors Nathan M. Wiegand, Charles B. Ward

Publication date 12 March 2010

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2009.04.012

zbMATH Keywords

approximation algorithmslabeled pathsshortest pathswireless routing metrics

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• On the complexity of quality of service routing
• Minimum cost path problems with relays
• Metric and distributed on-line algorithm for minimizing routing interference in wireless sensor networks
• Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
• Algorithms for finding paths with multiple constraints

Cited in

(1)

• A trichotomy for regular simple path queries on graphs

This page was built for publication: Complexity results on labeled shortest path problems from wireless routing metrics

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