Survivable network design problems in wireless networks
暂无分享,去创建一个
[1] Andrea E. F. Clementi,et al. On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..
[2] Robert Tappan Morris,et al. ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.
[3] Andrea E. F. Clementi,et al. The Power Range Assignment Problem in Radio Networks on the Plane , 2000, STACS.
[4] Guy Kortsarz,et al. Approximating minimum-power edge-covers and 2, 3-connectivity , 2009, Discret. Appl. Math..
[5] Arindam Kumar Das,et al. Minimum power broadcast trees for wireless networks: integer programming formulations , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[6] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[7] Robert J. Marks,et al. Minimum power broadcast trees for wireless networks: optimizing using the viability lemma , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).
[8] R. Ravi,et al. A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.
[9] Weifa Liang,et al. Constructing minimum-energy broadcast trees in wireless ad hoc networks , 2002, MobiHoc '02.
[10] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[11] Peter L. Hammer,et al. Discrete Applied Mathematics , 1993 .
[12] Vahab S. Mirrokni,et al. Power Optimization for Connectivity Problems , 2005, IPCO.
[13] Nicole Immorlica,et al. Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks , 2007, TNET.
[14] Jie Li,et al. A novel tree-based broadcast algorithm for wireless ad hoc networks , 2006, Int. J. Wirel. Mob. Comput..
[15] Radha Poovendran,et al. Maximizing Network Lifetime of Broadcasting Over Wireless Stationary Ad Hoc Networks , 2005, Mob. Networks Appl..
[16] Ernst Althaus,et al. Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks , 2006, Wirel. Networks.
[17] Frank Harary,et al. Graph Theory , 2016 .
[18] Debmalya Panigrahi,et al. Minimum Cost Topology Construction for Rural Wireless Mesh Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[19] Andrea E. F. Clementi,et al. Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks , 1999, RANDOM-APPROX.
[20] Kamal Jain,et al. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[21] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[22] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[23] Peng-Jun Wan,et al. Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks , 2006, Mob. Networks Appl..
[24] Gruia Calinescu,et al. Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.
[25] Elena Tsanko,et al. Approximating Minimum-Power Degree and Connectivity Problems , 2008, Algorithmica.
[26] Zeev Nutov. Approximating Steiner Networks with Node-Weights , 2010, SIAM J. Comput..
[27] Zeev Nutov,et al. On minimum power connectivity problems , 2010, J. Discrete Algorithms.
[28] Aditya Bhaskara,et al. Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.
[29] Sayandeep Sen,et al. Long distance wireless mesh network planning: problem formulation and solution , 2007, WWW '07.
[30] Radha Poovendran,et al. Iterated local optimization for minimum energy broadcast , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).
[31] Nicole Immorlica,et al. Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks , 2007, IEEE/ACM Trans. Netw..
[32] Zeev Nutov. Approximating Minimum-Power k-Connectivity , 2010, Ad Hoc Sens. Wirel. Networks.
[33] Samir Khuller,et al. Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.
[34] Zeev Nutov. Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems , 2006, APPROX-RANDOM.
[35] Zeev Nutov,et al. Approximating minimum power covers of intersecting families and directed edge-connectivity problems , 2010, Theor. Comput. Sci..
[36] Debmalya Panigrahi,et al. VillageNet: A low-cost, 802.11-based mesh network for rural regions , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.