Survivable network design problems in wireless networks
From MaRDI portal
Publication:5365097
zbMATH Open1373.68053MaRDI QIDQ5365097FDOQ5365097
Authors: Debmalya Panigrahi 
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133114
Recommendations
Cited In (18)
- Spider covering algorithms for network design problems
- An efficient link allocation algorithm for survivable ATM-based personal communication networks
- Design of survivable wireless backhaul networks with reliability considerations
- Minimum shared‐power edge cut
- An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
- Wireless network design via 3-decompositions
- Balls and funnels: energy efficient group-to-group anycasts
- Hardness of minimum barrier shrinkage and minimum installation path
- Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks
- Approximating activation edge-cover and facility location problems
- Survivable minimum bottleneck networks
- Title not available (Why is that?)
- Survivable network activation problems
- Designing least-cost survivable wireless backhaul networks
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- Survivable network activation problems
This page was built for publication: Survivable network design problems in wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365097)
