{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:20Z","timestamp":1770993980685,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642002014","type":"print"},{"value":"9783642002021","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_32","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"369-380","source":"Crossref","is-referenced-by-count":5,"title":["The Minimal Manhattan Network Problem in Three Dimensions"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Mu\u00f1oz","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Seibert","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On Sparse Spanners of Weighted Graphs. Discrete Comput. Geom.\u00a09, 81\u2013100 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.comgeo.2005.09.004","volume":"35","author":"M. Benkert","year":"2006","unstructured":"Benkert, M., Shirabe, T., Widmann, F., Wolff, A.: The Minimum Manhattan Network Problem\u2014Approximations and Exact Solution. Computational Geometry: Theory and Applications\u00a035(3), 188\u2013208 (2006)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"32_CR3","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation Hardness of Short Symmetric Instances of MAX-3SAT Electronic Colloquium on Computational Complexity Report No. 49 (2003), \n                    \n                      http:\/\/eccc.hpi-web.de\/eccc-reports\/2003\/TR03-049\/"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1142\/S0218195995000088","volume":"5","author":"B. Chandra","year":"1995","unstructured":"Chandra, B., Das, G., Narasimhan, G., Soares, J.: New Sparseness Results on Graph Spanners. Internat. J. Comput. Geom. Appl.\u00a05, 125\u2013144 (1995)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0166-218X(00)00280-8","volume":"110","author":"D. Chen","year":"2001","unstructured":"Chen, D., Das, G., Smid, M.: Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Applied Math.\u00a0110, 151\u2013167 (2001)","journal-title":"Discrete Applied Math."},{"key":"32_CR6","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. Theoret. Comp. Sci.\u00a0390, 56\u201369 (2008)","journal-title":"Theoret. Comp. Sci."},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1142\/S0218195997000193","volume":"7","author":"G. Das","year":"1997","unstructured":"Das, G., Narasimhan, G.: A Fast Algorithm for Constructing Sparse Euclidian Spanners. Internat. J. Comput. Geom. Appl.\u00a07, 297\u2013315 (1997)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"32_CR8","unstructured":"Engels, B.: The Transitive Minimum Manhattan Subnetwork Problem in 3 Dimensions. Submitted to Discrete Applied Mathematics: Proceedings of the 6th Cologne Twente Workshop 2007 (November 12, 2007)"},{"key":"32_CR9","first-page":"219","volume":"8","author":"J. Gudmundsson","year":"2001","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Approximating a Minimum Manhattan Network. Nordic J. Computing\u00a08, 219\u2013232 (2001)","journal-title":"Nordic J. Computing"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1137\/S0097539700382947","volume":"31","author":"J. Gudmundsson","year":"2002","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Computing\u00a031, 1479\u20131500 (2002)","journal-title":"SIAM J. Computing"},{"key":"32_CR11","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":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/11602613_26","volume-title":"Algorithms and Computation","author":"S. Seibert","year":"2005","unstructured":"Seibert, S., Unger, W.: A 1.5-approximation of the minimal manhattan network problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 246\u2013255. Springer, Heidelberg (2005)"},{"key":"32_CR13","unstructured":"Seibert, S., Unger, W.: Refined Analysis of the Minimal Manhattan Network Problem and a 1.25 Approximation (submitted for publication)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T02:53:52Z","timestamp":1551754432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}