Reception Capacity Through Perfect Domination
暂无分享,去创建一个
[1] Magnús M. Halldórsson,et al. Wireless connectivity and capacity , 2012, SODA.
[2] Magnús M. Halldórsson,et al. How Well Can Graphs Represent Wireless Interference? , 2014, STOC.
[3] Richard C. T. Lee,et al. The Weighted Perfect Domination Problem , 1990, Inf. Process. Lett..
[4] Roger Wattenhofer,et al. Capacity of Arbitrary Wireless Networks , 2009, IEEE INFOCOM 2009.
[5] Uriel Feige,et al. Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[6] Michael Dinitz,et al. Distributed Algorithms for Approximating Wireless Network Capacity , 2010, 2010 Proceedings IEEE INFOCOM.
[7] Eyjólfur Ingi Ásgeirsson,et al. On a game theoretic approach to capacity maximization in wireless networks , 2011, 2011 Proceedings IEEE INFOCOM.
[8] Roger Wattenhofer,et al. Algorithms for Wireless Capacity , 2014, IEEE/ACM Transactions on Networking.
[9] Magnús M. Halldórsson,et al. Wireless capacity with oblivious power in general metrics , 2011, SODA '11.
[10] Magnús M. Halldórsson,et al. Wireless capacity with arbitrary gain matrix , 2014, Theor. Comput. Sci..
[11] Thomas Kesselheim,et al. A constant-factor approximation for wireless capacity maximization with power control in the SINR model , 2010, SODA '11.
[12] Erik D. Demaine,et al. Combination can be hard: approximability of the unique coverage problem , 2006, SODA '06.
[13] Michael Dinitz,et al. Braess's Paradox in Wireless Networks: The Danger of Improved Technology , 2013, DISC.
[14] Paul M. Weichsel,et al. Dominating sets in n-cubes , 1994, J. Graph Theory.
[15] Michael Dinitz,et al. Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory , 2009, IEEE INFOCOM 2009.