{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:04:53Z","timestamp":1740096293817,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_67","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T21:32:52Z","timestamp":1386797572000},"page":"722-732","source":"Crossref","is-referenced-by-count":1,"title":["Approximating the Generalized Minimum Manhattan Network Problem"],"prefix":"10.1007","author":[{"given":"Aparna","family":"Das","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Fleszar","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[]},{"given":"Sankar","family":"Veeramoni","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1\u20132","key":"67_CR1","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.\u00a097(1-2), 43\u201369 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"67_CR2","doi-asserted-by":"publisher","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.\u00a0390(1), 56\u201369 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"67_CR3","doi-asserted-by":"publisher","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. Discrete Comput. Geom.\u00a045, 701\u2013722 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"67_CR4","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/157485.165065","volume-title":"30th IEEE Conf. Design Automation (DAC 1993)","author":"J. Cong","year":"1993","unstructured":"Cong, J., Leung, K.S., Zhou, D.: Performance-driven interconnect design based on distributed RC delay model. In: 30th IEEE Conf. Design Automation (DAC 1993), pp. 606\u2013611. IEEE Press, New York (1993)"},{"key":"67_CR5","unstructured":"Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the generalized minimum Manhattan network problem. Arxiv report (2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1203.6481"},{"key":"67_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-23719-5_5","volume-title":"Algorithms \u2013 ESA 2011","author":"A. Das","year":"2011","unstructured":"Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S., Spoerhase, J., Wolff, A.: Approximating minimum Manhattan networks in higher dimensions. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 49\u201360. Springer, Heidelberg (2011), to appear in Algorithmica, \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s00453-013-9778-z"},{"key":"67_CR7","unstructured":"Gudmundsson, J., Klein, O., Knauer, C., Smid, M.: Small Manhattan networks and algorithmic applications for the Earth Mover\u2019s Distance. In: 23rd Europ. Workshop Comput. Geom (EuroCG 2007), Graz, Austria, pp. 174\u2013177 (2007)"},{"key":"67_CR8","first-page":"219","volume":"8","author":"J. Gudmundsson","year":"2001","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Approximating a minimum Manhattan network. Nordic J. Comput.\u00a08, 219\u2013232 (2001)","journal-title":"Nordic J. Comput."},{"key":"67_CR9","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":"67_CR10","doi-asserted-by":"publisher","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.\u00a021(3), 331\u2013350 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"67_CR11","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.\u00a02(1), 189\u2013204 (2011)","journal-title":"J. Comput. Geom."},{"issue":"3","key":"67_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/A:1009826311973","volume":"4","author":"B. Lu","year":"2000","unstructured":"Lu, B., Ruan, L.: Polynomial time approximation scheme for the rectilinear Steiner arborescence problem. J. Comb. Optim.\u00a04(3), 357\u2013363 (2000)","journal-title":"J. Comb. Optim."},{"key":"67_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-00202-1_32","volume-title":"WALCOM: Algorithms and Computation","author":"X. Mu\u00f1oz","year":"2009","unstructured":"Mu\u00f1oz, X., Seibert, S., Unger, W.: The minimal Manhattan network problem in three dimensions. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.\u00a05431, pp. 369\u2013380. Springer, Heidelberg (2009)"},{"key":"67_CR14","doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546884"},{"issue":"1","key":"67_CR15","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. Zeitschrift Oper. Res.\u00a018(1), 59\u201367 (1974)","journal-title":"Zeitschrift Oper. Res."},{"key":"67_CR16","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                    \n                      http:\/\/www.lif-sud.univ-mrs.fr\/~karim\/download\/THESE_NOUIOUA.pdf"},{"key":"67_CR17","doi-asserted-by":"publisher","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\u00a07, 277\u2013288 (1992)","journal-title":"Algorithmica"},{"issue":"3","key":"67_CR18","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1137\/S0097539704371353","volume":"35","author":"W. Shi","year":"2005","unstructured":"Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. SIAM J. Comput.\u00a035(3), 729\u2013740 (2005)","journal-title":"SIAM J. Comput."},{"key":"67_CR19","unstructured":"Zachariasen, M.: On the approximation of the rectilinear Steiner arborescence problem in the plane (2000) (Manuscript), \n                    \n                      http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.43.4529"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T06:28:07Z","timestamp":1558765687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}