{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:04Z","timestamp":1770994084633,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540304678","type":"print"},{"value":"9783540320890","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589440_2","type":"book-chapter","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T12:08:15Z","timestamp":1131538095000},"page":"16-28","source":"Crossref","is-referenced-by-count":6,"title":["The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation"],"prefix":"10.1007","author":[{"given":"Marc","family":"Benkert","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Widmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","first-page":"489","volume-title":"Analysis of Dynamical and Cognitive Systems","author":"S. Arya","year":"1995","unstructured":"Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.: Euclidean spanners: Short, thin, and lanky. In: Andersson, S.I. (ed.) Summer University of Southern Stockholm 1993. LNCS, vol.\u00a0888, pp. 489\u2013498. Springer, Heidelberg (1995)"},{"key":"2_CR2","unstructured":"Benkert, M., Widmann, F., Wolff, A.: The minimum Manhattan network problem: A fast factor-3 approximation. Technical Report 2004-16, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (2004), Available at \n                  \n                    http:\/\/www.ubka.uni-karlsruhe.de\/cgi-bin\/psview?document=\/ira\/2004\/16"},{"key":"2_CR3","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":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-36136-7_31","volume-title":"Algorithms and Computation","author":"R. Kato","year":"2002","unstructured":"Kato, R., Imai, K., Asano, T.: An improved algorithm for the minimum Manhattan network problem. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 344\u2013356. Springer, Heidelberg (2002)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1089\/10665270360688156","volume":"10","author":"F. Lam","year":"2003","unstructured":"Lam, F., Alexandersson, M., Pachter, L.: Picking alignments from (Steiner) trees. Journal of Computational Biology\u00a010, 509\u2013520 (2003)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589440_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:47:38Z","timestamp":1619506058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589440_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304678","9783540320890"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11589440_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}