Communication-constrained p-center problem for event coverage in theme parks
暂无分享,去创建一个
[1] David Avis,et al. Reverse Search for Enumeration , 1996, Discret. Appl. Math..
[2] J. Reese,et al. Solution methods for the p-median problem: An annotated bibliography , 2006 .
[3] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[4] Gürkan Solmaz,et al. Optimizing event coverage in theme parks , 2014, Wirel. Networks.
[5] William Chung-Kung Yen,et al. The Connected p-Center Problem with Extension , 2006, JCIS.
[6] William Chung-Kung Yen,et al. The connected p-center problem on block graphs with forbidden vertices , 2012, Theor. Comput. Sci..
[7] Mohamed F. Younis,et al. Strategies and techniques for node placement in wireless sensor networks: A survey , 2008, Ad Hoc Networks.
[8] J. Reese,et al. Solution methods for the p‐median problem: An annotated bibliography , 2006, Networks.
[9] Azzedine Boukerche,et al. Routing protocols in ad hoc networks: A survey , 2011, Comput. Networks.
[10] William Chung-Kung Yen,et al. The p-Center Problem with Connectivity Constraint 1 , 2007 .
[11] Mohamed F. Younis,et al. COLA: A Coverage and Latency Aware Actor Placement for Wireless Sensor and Actor Networks , 2006, IEEE Vehicular Technology Conference.
[12] Jie Gao,et al. Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network , 2010, 2010 Proceedings IEEE INFOCOM.
[13] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .
[14] Mustafa Ç. Pınar,et al. An exact algorithm for the capacitated vertex p-center problem , 2006, Comput. Oper. Res..
[15] Gürkan Solmaz,et al. Event coverage in theme parks using wireless sensor networks with mobile sinks , 2013, 2013 IEEE International Conference on Communications (ICC).