{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:01Z","timestamp":1725638221280},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_27","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"250-259","source":"Crossref","is-referenced-by-count":7,"title":["Angle-Restricted Steiner Arborescences for Flow Map Layout"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"CSISS - Spatial Tools: Tobler\u2019s Flow Mapper, http:\/\/www.csiss.org\/clearinghouse\/FlowMapper"},{"issue":"1-2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00233-X","volume":"109","author":"O. Aichholzer","year":"2001","unstructured":"Aichholzer, O., Aurenhammer, F., Icking, C., Klein, R., Langetepe, E., Rote, G.: Generalized self-approaching curves. Discr. Appl. Mathem.\u00a0109(1-2), 3\u201324 (2001)","journal-title":"Discr. Appl. Mathem."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Baratz, A., Peleg, D.: Cost-sensitive analysis of communication protocols. In: Proc. 9th ACM Symposium on Principles of Distributed Computing, pp. 177\u2013187. ACM (1990)","DOI":"10.1145\/93385.93417"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1011903210297","volume":"21","author":"M. Brazil","year":"2001","unstructured":"Brazil, M., Rubinstein, J.H., Thomas, D.A., Weng, J.F., Wormald, N.C.: Gradient-constrained minimum networks. I. Fundamentals. Journal of Global Optimization\u00a021, 139\u2013155 (2001)","journal-title":"Journal of Global Optimization"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1002\/net.20140","volume":"49","author":"M. Brazil","year":"2007","unstructured":"Brazil, M., Thomas, D.A.: Network optimization for the design of underground mines. Networks\u00a049, 40\u201350 (2007)","journal-title":"Networks"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Buchin, K., Speckmann, B., Verbeek, K.: Flow map layout via spiral trees. IEEE Transactions on Visualization and Computer Graphics (to appear, 2011) (Proceedings Visualization \/ Information Visualization 2011)","DOI":"10.1109\/TVCG.2011.202"},{"key":"27_CR7","unstructured":"C\u00f3rdova, J., Lee, Y.: A heuristic algorithm for the rectilinear Steiner arborescence problem. Technical report, Engineering Optimization (1994)"},{"key":"27_CR8","volume-title":"Cartography: Thematic Map Design","author":"B.D. Dent","year":"1999","unstructured":"Dent, B.D.: Cartography: Thematic Map Design, 5th edn. McGraw-Hill, New York (1999)","edition":"5"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.2514\/atcq.14.2.159","volume":"14","author":"J. Krozel","year":"2006","unstructured":"Krozel, J., Lee, C., Mitchell, J.: Turn-constrained route planning for avoiding hazardous weather. Air Traffic Control Quarterly\u00a014(2), 159\u2013182 (2006)","journal-title":"Air Traffic Control Quarterly"},{"issue":"3","key":"27_CR10","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. Optimization\u00a04(3), 357\u2013363 (2000)","journal-title":"J. Comb. Optimization"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01758836","volume":"8","author":"J. Mitchell","year":"1992","unstructured":"Mitchell, J.: L 1 shortest paths among polygonal obstacles in the plane. Algorithmica\u00a08, 55\u201388 (1992)","journal-title":"Algorithmica"},{"key":"27_CR12","unstructured":"Phan, D., Xiao, L., Yeh, R., Hanrahan, P., Winograd, T.: Flow map layout. In: Proc. IEEE Symposium on Information Visualization, pp. 219\u2013224 (2005)"},{"issue":"7","key":"27_CR13","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/TCAD.2003.814249","volume":"22","author":"S. Ramnath","year":"2003","unstructured":"Ramnath, S.: New approximations for the rectilinear Steiner arborescence problem. IEEE Trans. Computer-Aided Design Integ. Circuits Sys.\u00a022(7), 859\u2013869 (2003)","journal-title":"IEEE Trans. Computer-Aided Design Integ. Circuits Sys."},{"key":"27_CR14","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"},{"key":"27_CR15","unstructured":"Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 780\u2013787 (2000)"},{"issue":"3","key":"27_CR16","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 Journal on Computing\u00a035(3), 729\u2013740 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR17","volume-title":"Thematic Cartography and Geovisualization","author":"T.A. Slocum","year":"2010","unstructured":"Slocum, T.A., McMaster, R.B., Kessler, F.C., Howard, H.H.: Thematic Cartography and Geovisualization, 3rd edn. Pearson, New Jersey (2010)","edition":"3"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1559\/152304087783875273","volume":"14","author":"W. Tobler","year":"1987","unstructured":"Tobler, W.: Experiments in migration mapping by computer. The American Cartographer\u00a014(2), 155\u2013163 (1987)","journal-title":"The American Cartographer"}],"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-25591-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T06:11:35Z","timestamp":1561011095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}