Author:
Chin Francis Y. L.,Guo Zeyu,Sun He
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference12 articles.
1. Benkert, M., Wolff, A., Widmann, F.: The minimum Manhattan network problem: a fast factor-3 approximation. In: Proceedings of the 8th Japanese Conference on Discrete and Computational Geometry, pp. 16–28 (2005)
2. Benkert, M., Wolff, A., Widmann, F., Shirabe, T.: The minimum Manhattan network problem: approximations and exact solutions. Comput. Geom., Theory Appl. 35, 188–208 (2006)
3. Chepoi, V., Nouioua, K., Vaxès, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390, 56–69 (2008)
4. Gudmundsson, J., Klein, O., Knauer, C., Smid, M.: Small Manhattan networks and algorithmic applications for the Earth mover’s distance. In: Proceedings of the 23rd European Workshop on Computational Geometry, pp. 174–177 (2007)
5. Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Approximating a minimum Manhattan network. Nord. J. Comput. 8, 219–232 (2001)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献