Publisher
Springer International Publishing
Reference24 articles.
1. Assis, F.: A deterministic and a randomized algorithm for approximating minimum spanning tree under the SINR model. In: Proceeding of the 8th IFIP Wireless and Mobile Networking Conference - WMNC (2015)
2. Bahramgiri, M., Hajiaghayi, M., Mirrokni, V.S.: Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. Wirel. Netw. 12, 179–188 (2006)
3. Cheryian, J., Végh, L.A.: Approximating minimum-cost k-node connected subgraphs via independence-free graphs. In: Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) (2013)
4. Cornejo, A., Lynch, N.: Fault-tolerance through k-connectivity.In: Proceedings of IEEE International Conference on Robotics and Automation (ICRA): Workshop on Network Science and Systems Issues in Multi-Robot Autonomy (2010)
5. Lecture Notes in Computer Science;S Daum,2013