{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:10Z","timestamp":1770994090331,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,3,2]],"date-time":"2017-03-02T00:00:00Z","timestamp":1488412800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Wo 758\/5-1"],"award-info":[{"award-number":["Wo 758\/5-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00453-017-0298-0","type":"journal-article","created":{"date-parts":[[2017,3,2]],"date-time":"2017-03-02T09:30:15Z","timestamp":1488447015000},"page":"1170-1190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Approximating the Generalized Minimum Manhattan Network Problem"],"prefix":"10.1007","volume":"80","author":[{"given":"Aparna","family":"Das","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Fleszar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2601-6452","authenticated-orcid":false,"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[]},{"given":"Sankar","family":"Veeramoni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,2]]},"reference":[{"key":"298_CR1","doi-asserted-by":"crossref","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size \n                        $$\\varepsilon $$\n                        \n                            \n                                \u03b5\n                            \n                        \n                    -nets for axis-parallel rectangles and boxes. In: Proceedings of the 41st Annual ACM Symposium on Theory Computing (STOC\u201909), pp. 639\u2013648 (2009)","DOI":"10.1145\/1536414.1536501"},{"key":"298_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S.: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings 38th Annual Symposium on Foundations of Computer Science (FOCS\u201997), pp. 554\u2013563 (1997)","DOI":"10.1109\/SFCS.1997.646145"},{"issue":"1\u20132","key":"298_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","volume":"97","author":"S Arora","year":"2003","unstructured":"Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97(1\u20132), 43\u201369 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"298_CR4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1009826311973","volume":"4","author":"L Bing","year":"2000","unstructured":"Bing, L., Ruan, L.: Polynomial time approximation scheme for the rectilinear Steiner arborescence problem. J. Comb. Optim. 4(3), 357\u2013363 (2000)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"298_CR5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discret. Comput. Geom. 14(1), 463\u2013479 (1995)","journal-title":"Discret. Comput. Geom."},{"key":"298_CR6","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/s00454-011-9342-z","volume":"45","author":"F Chin","year":"2011","unstructured":"Chin, F., Guo, Z., Sun, H.: Minimum Manhattan network is NP-complete. Discret. Comput. Geom. 45, 701\u2013722 (2011)","journal-title":"Discret. Comput. Geom."},{"key":"298_CR7","doi-asserted-by":"crossref","unstructured":"Cong, J., Leung, K.-S., Zhou, D.: Performance-driven interconnect design based on distributed RC delay model. In: Proceedings of the 30th IEEE Conference on Design Automation (DAC\u201993), pp. 606\u2013611 (1993)","DOI":"10.1145\/157485.165065"},{"issue":"1","key":"298_CR8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.tcs.2007.10.013","volume":"390","author":"V Chepoi","year":"2008","unstructured":"Chepoi, V., Nouioua, K., Vax\u00e8s, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1), 56\u201369 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"298_CR9","doi-asserted-by":"crossref","unstructured":"Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the generalized minimum Manhattan network problem. In: Cai, L., Cheng, S.-W., Lam, T.W. (eds.) Proceedings of the 24th Annual International Symposium on Algorithms and Computation (ISAAC\u201913), volume 8283 of LNCS, pp. 722\u2013732. Springer (2013)","DOI":"10.1007\/978-3-642-45030-3_67"},{"issue":"1","key":"298_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/s00453-013-9778-z","volume":"71","author":"A Das","year":"2015","unstructured":"Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S., Spoerhase, J., Wolff, A.: Approximating minimum Manhattan networks in higher dimensions. Algorithmica 71(1), 36\u201352 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"298_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.jcss.2011.05.009","volume":"78","author":"M Feldman","year":"2012","unstructured":"Feldman, M., Kortsarz, G., Nutov, Z.: Improved approximation algorithms for directed Steiner forest. J. Comput. Syst. Sci. 78(1), 279\u2013292 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"298_CR12","unstructured":"Funke, S., Seybold, M.P.: The generalized minimum Manhattan network problem\u2014scale-diversity aware approximation and a primal-dual algorithm. In: Proceedings of the 2nd Canadian Conference on Computing Geometry (CCCG\u201914), Halifax, Nova Scotia (2014)"},{"key":"298_CR13","unstructured":"Gudmundsson, J., Klein, O., Knauer, C., Smid, M.: Small Manhattan networks and algorithmic applications for the Earth Mover\u2019s Distance. In Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG\u201907), pp. 174\u2013177, Graz, Austria (2007)"},{"key":"298_CR14","first-page":"219","volume":"8","author":"J Gudmundsson","year":"2001","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Approximating a minimum Manhattan network. Nord. J. Comput. 8, 219\u2013232 (2001)","journal-title":"Nord. J. Comput."},{"key":"298_CR15","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Narasimhan, G., Smid, M.: Applications of geometric spanner networks. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp 1\u201399. Springer (2008)","DOI":"10.1007\/978-0-387-30162-4_15"},{"issue":"3","key":"298_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1142\/S0218195911003688","volume":"21","author":"Z Guo","year":"2011","unstructured":"Guo, Z., Sun, H., Zhu, H.: Greedy construction of 2-approximate minimum Manhattan networks. Int. J. Comput. Geom. Appl. 21(3), 331\u2013350 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"298_CR17","first-page":"189","volume":"2","author":"C Knauer","year":"2011","unstructured":"Knauer, C., Spillner, A.: A fixed-parameter algorithm for the minimum Manhattan network problem. J. Comput. Geom. 2(1), 189\u2013204 (2011)","journal-title":"J. Comput. Geom."},{"key":"298_CR18","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, X., Seibert, S., Unger, W.: The minimal Manhattan network problem in three dimensions. In: Das, S., Uehara, R. (eds.) Proceedings of the 3rd International Workshop on Algorithms and Computing (WALCOM\u201909), volume 5431 of LNCS, pp. 369\u2013380. Springer (2009)","DOI":"10.1007\/978-3-642-00202-1_32"},{"key":"298_CR19","unstructured":"Nouioua, K.: Enveloppes de Pareto et R\u00e9seaux de Manhattan: Caract\u00e9risations et Algorithmes. PhD thesis, Universit\u00e9 de la M\u00e9diterran\u00e9e, (2005). \n                        http:\/\/www.lif-sud.univ-mrs.fr\/~karim\/download\/THESE_NOUIOUA.pdf"},{"key":"298_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"298_CR21","first-page":"59","volume":"18","author":"L Nastansky","year":"1974","unstructured":"Nastansky, L., Selkow, S.M., Stewart, N.F.: Cost-minimal trees in directed acyclic graphs. Z. Oper. Res. 18(1), 59\u201367 (1974)","journal-title":"Z. Oper. Res."},{"key":"298_CR22","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01758762","volume":"7","author":"S Rao","year":"1992","unstructured":"Rao, S., Sadayappan, P., Hwang, F., Shor, P.: The rectilinear Steiner arborescence problem. Algorithmica 7, 277\u2013288 (1992)","journal-title":"Algorithmica"},{"issue":"3","key":"298_CR23","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1137\/S0097539704371353","volume":"35","author":"W Shi","year":"2005","unstructured":"Shi, W., Chen, S.: The rectilinear Steiner arborescence problem is NP-complete. SIAM J. Comput. 35(3), 729\u2013740 (2005)","journal-title":"SIAM J. Comput."},{"key":"298_CR24","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Berlin (2001)"},{"issue":"4","key":"298_CR25","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"ACC Yao","year":"1982","unstructured":"Yao, A.C.C.: On constructing minimum spanning trees in \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -dimensional spaces and related problems. SIAM J. Comput. 11(4), 721\u2013736 (1982)","journal-title":"SIAM J. Comput."},{"key":"298_CR26","unstructured":"Zachariasen, M.: On the approximation of the rectilinear Steiner arborescence problem in the plane. \n                        http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.43.4529\n                        \n                    . (2000)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0298-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0298-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0298-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T14:52:46Z","timestamp":1519743166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0298-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,2]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["298"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0298-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,2]]}}}