The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α,β)-Pair Decomposition
暂无分享,去创建一个
Michael Segal | Matthew J. Katz | Paz Carmi | A. Karim Abu-Affash | M. J. Katz | M. Segal | A. K. Abu-Affash | Paz Carmi
[1] Michael Segal,et al. Dynamic Coverage in Ad-Hoc Sensor Networks , 2005, Mob. Networks Appl..
[2] Xiang-Yang Li. Wireless Ad Hoc and Sensor Networks: Acknowledgments , 2008 .
[3] Guohui Lin,et al. Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..
[4] Kasturi R. Varadarajan. A divide-and-conquer algorithm for min-cost perfect matching in the plane , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[5] Giri Narasimhan,et al. Geometric spanner networks , 2007 .
[6] Lusheng Wang,et al. An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane , 2002, Inf. Process. Lett..
[7] Micha Sharir,et al. An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..
[8] Chia-Mei Chen,et al. An optimal new-node placement to enhance the coverage of wireless sensor networks , 2010, Wirel. Networks.
[9] Timothy M. Chan. On Enumerating and Selecting Distances , 2001, Int. J. Comput. Geom. Appl..
[10] Béla Bollobás,et al. On separating systems , 2007, Eur. J. Comb..
[11] Xiang-Yang Li,et al. Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..
[12] Ronald L. Rivest,et al. Introduction to Algorithms, 3rd Edition , 2009 .
[13] Kenneth L. Clarkson,et al. Approximation algorithms for shortest path motion planning , 1987, STOC.
[14] Andrew Chi-Chih Yao,et al. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..
[15] J. Mark Keil,et al. Approximating the Complete Euclidean Graph , 1988, Scandinavian Workshop on Algorithm Theory.
[16] Michiel H. M. Smid,et al. Communication-Efficient Construction of the Plane Localized Delaunay Graph , 2010, LATIN.
[17] Joachim Gudmundsson,et al. Region-Fault Tolerant Geometric Spanners , 2007, SODA '07.
[18] Sergey Bereg,et al. Fast Algorithms for Approximating Distances , 2002, Algorithmica.
[19] Lusheng Wang,et al. Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.
[20] Michael Segal,et al. On Bounded Leg Shortest Paths Problems , 2007, SODA '07.
[21] Xiang-Yang Li. Wireless Ad Hoc and Sensor Networks: Topology Control and Clustering , 2008 .
[22] Sang Won Bae,et al. On exact solutions to the Euclidean bottleneck Steiner tree problem , 2009, Inf. Process. Lett..
[23] Donald B. Johnson,et al. Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..
[24] Sariel Har-Peled,et al. New constructions of SSPDs and their applications , 2012, Comput. Geom..
[25] Xiang-Yang Li. Wireless Ad Hoc and Sensor Networks: Theory and Applications , 2008 .
[26] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[27] Da-Ming Zhu,et al. Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane , 2008, Journal of Computer Science and Technology.
[28] Luís E. T. Rodrigues,et al. Fast Localized Delaunay Triangulation , 2004, OPODIS.
[29] Lusheng Wang,et al. Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..
[30] Miodrag Potkonjak,et al. Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.
[31] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[32] Lusheng Wang,et al. Approximations for a Bottleneck Steiner Tree Problem , 2001, Algorithmica.
[33] S. Rao Kosaraju,et al. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.
[34] Sariel Har-Peled,et al. Net and Prune , 2014, J. ACM.