Author:
Das Aparna,Gansner Emden R.,Kaufmann Michael,Kobourov Stephen,Spoerhase Joachim,Wolff Alexander
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97(1–2), 43–69 (2003). doi: 10.1007/s10107-003-0438-y
2. Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.: Euclidean spanners: short, thin, and lanky. In: Proc. 27th Annu. ACM Sympos. Theory Comput. (STOC’95), pp. 489–498 (1995). doi: 10.1145/225058.225191
3. Benkert, M., Wolff, A., Widmann, F., Shirabe, T.: The minimum Manhattan network problem: approximations and exact solutions. Comput. Geom. Theory Appl. 35(3), 188–208 (2006). doi: 10.1016/j.comgeo.2005.09.004
4. Charikar, M., Chekuri, C., Cheung, T.Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. J. Algorithms 33(1), 73–91 (1999). doi: 10.1006/jagm.1999.1042
5. Chepoi, V., Nouioua, K., Vaxès, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1), 56–69 (2008). doi: 10.1016/j.tcs.2007.10.013
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献