{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:21:46Z","timestamp":1790749306866,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309352","type":"print"},{"value":"9783540324263","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_26","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"246-255","source":"Crossref","is-referenced-by-count":10,"title":["A 1.5-Approximation of the Minimal Manhattan Network Problem"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Seibert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_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. Geoam.\u00a09, 81\u2013100 (1993)","journal-title":"Discrete Comput. Geoam."},{"key":"26_CR2","unstructured":"Benkert, M., Shirabe, T., Wolff, A.: The Minimum Manhattan Network Problem\u2014Approximations and Exact Solution. In: Proc. 20th European Workshop on Computational Geometry (EWCG 2004), pp. 209\u2013212 (2004)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/11589440_2","volume-title":"Discrete and Computational Geometry","author":"M. Benkert","year":"2005","unstructured":"Benkert, M., Wolff, A., Widmann, F.: The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. In: Akiyama, J., Kano, M., Tan, X. (eds.) JCDCG 2004. LNCS, vol.\u00a03742, pp. 85\u201386. Springer, Heidelberg (2005)"},{"key":"26_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 Resuls on Graph Spanners. Internat. J. Comput. Geom. Appl.\u00a05, 125\u2013144 (1995)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"26_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":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11538462_4","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"V. Chepoi","year":"2005","unstructured":"Chepoi, V., Nouioua, K., Vaxes, Y.: A rounding algorithm for approximating minimum Manhattan networks. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 40\u201351. Springer, Heidelberg (2005)"},{"key":"26_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":"26_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. Computing\u00a08, 219\u2013232 (2001)","journal-title":"Nordic J. Computing"},{"key":"26_CR9","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":"26_CR10","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)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:43Z","timestamp":1619506963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11602613_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}