Author:
Chambers Erin,Erickson Alejandro,Fekete Sándor,Lenchner Jonathan,Sember Jeff,Venkatesh Srinivasan,Stege Ulrike,Stolpner Svetlana,Weibel Christophe,Whitesides Sue
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Alt, H., Arkin, E., Brönnimann, H., Erickson, J., Fekete, S., Knauer, C., Lenchner, J., Mitchell, J., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Proc. 22nd ACM Symp. Comp. Geom. (SoCG), pp. 449–458 (2006)
2. Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Disc. Appl. Mathematics 55(3), 197–218 (1994)
3. Chambers, E., Erickson, A., Fekete, S., Lenchner, J., Sember, J., Venkatesh, S., Stege, U., Stolpner, S., Weibel, C., Whitesides, S.: Connectivity graphs of uncertainty regions. arXiV:1009.3469 (2010)
4. Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Technical Report TR00-054, Electronic Colloquium on Computational Complexity (2000)
5. de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. J. Algorithms 57(1), 22–36 (2005)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献