Connecting a Set of Circles with Minimum Sum of Radii
暂无分享,去创建一个
Joseph S. B. Mitchell | Srinivasan Venkatesh | Erin W. Chambers | Sándor P. Fekete | Sue Whitesides | Ulrike Stege | Hella-Franziska Hoffmann | Dimitri Marinakis
[1] Andrea E. F. Clementi,et al. On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..
[2] David Peleg,et al. Polynomial time approximation schemes for base station coverage with minimum total radii , 2005, Comput. Networks.
[3] Matt Gibson,et al. On clustering to minimize the sum of radii , 2008, SODA '08.
[4] Madhav V. Marathe,et al. Approximation Algorithms for Clustering to Minimize the Sum of Diameters , 2000, Nord. J. Comput..
[5] Joseph S. B. Mitchell,et al. The minimum area spanning tree problem , 2006, EuroCG.
[6] David Avis,et al. Reverse Search for Enumeration , 1996, Discret. Appl. Math..
[7] Vittorio Bilò,et al. Geometric Clustering to Minimize the Sum of Cluster Sizes , 2005, ESA.
[8] Esther M. Arkin,et al. Minimum-cost coverage of point sets by disks , 2006, SCG '06.
[9] Rina Panigrahy,et al. Clustering to minimize the sum of cluster diameters , 2001, STOC '01.
[10] Bernhard Fuchs. On the hardness of range assignment problems , 2008 .