## Minimum Cost Topology Construction for Rural Wireless Mesh Networks

- Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, K. V. M. Naidu, Rajeev Rastogi
- IEEE INFOCOM 2008 - The 27th Conference on…
- 2008

Highly Influenced

@article{Nutov2006ApproximatingMP, title={Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems}, author={Zeev Nutov}, journal={Theor. Comput. Sci.}, year={2006}, volume={411}, pages={2502-2512} }

- Published 2006 in APPROX-RANDOM
DOI:10.1007/11830924_23

Given a (directed) graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we consider fundamental directed connectivity network design problems under the power minimization criteria. Let G = (V, E) be a graph with edge-costs {c(e) : e ∈ E} and let k be an integer. We consider finding a minimum power subgraph G of G that satisfies some… CONTINUE READING