Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1688358
- Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
- Power Optimization for Connectivity Problems
- Power optimization for connectivity problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Cited in
(10)- Finding optimal paths in MREP routing
- Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
- Complexity results on labeled shortest path problems from wireless routing metrics
- Routing algorithms under mutual interference constraints
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
- A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
- Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks
- An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
This page was built for publication: Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448791)
