Author:
Masumura Yuya,Oki Taihei,Yamaguchi Yutaro
Publisher
Springer International Publishing
Reference16 articles.
1. Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Programm. 97(1–2), 43–69 (2003)
2. Chepoi, V., Nouioua, K., Vaxès, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1), 56–69 (2008)
3. Chin, F.Y., Guo, Z., Sun, H.: Minimum Manhattan network is NP-complete. Discrete Comput. Geom. 45(4), 701–722 (2011)
4. Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the generalized minimum Manhattan network problem. Algorithmica 80(4), 1170–1190 (2018)
5. Funke, S., Seybold, M.P.: The generalized minimum Manhattan network problem (GMMN) - scale-diversity aware approximation and a primal-dual algorithm. In: Proceedings of Canadian Conference on Computational Geometry (CCCG), vol. 26 (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献