{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:28Z","timestamp":1770994108224,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,23]],"date-time":"2014-01-23T00:00:00Z","timestamp":1390435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00453-013-9867-z","type":"journal-article","created":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T22:18:44Z","timestamp":1390429124000},"page":"656-685","source":"Crossref","is-referenced-by-count":9,"title":["Angle-Restricted Steiner Arborescences for Flow Map Layout"],"prefix":"10.1007","volume":"72","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,23]]},"reference":[{"key":"9867_CR1","unstructured":"CSISS - Spatial Tools: Tobler\u2019s Flow Mapper. http:\/\/www.csiss.org\/clearinghouse\/FlowMapper . Retrieved January\u00a030 (2013)"},{"issue":"1\u20132","key":"9867_CR2","doi-asserted-by":"crossref","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. Discrete Appl. Math. 109(1\u20132), 3\u201324 (2001)","journal-title":"Discrete Appl. Math."},{"key":"9867_CR3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/93385.93417","volume-title":"Proc. 9th ACM Symposium on Principles of Distributed Computing","author":"B. Awerbuch","year":"1990","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 (1990)"},{"key":"9867_CR4","volume-title":"Proc. Workshop in Geospatial Visual Analytics: Focus on Time (GeoVA(t))","author":"I. Boyandin","year":"2010","unstructured":"Boyandin, I., Bertini, E., Lalanne, D.: Using flow maps to explore migrations over time. In: Proc. Workshop in Geospatial Visual Analytics: Focus on Time (GeoVA(t)) (2010)"},{"key":"9867_CR5","doi-asserted-by":"crossref","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. J. Glob. Optim. 21, 139\u2013155 (2001)","journal-title":"J. Glob. Optim."},{"key":"9867_CR6","doi-asserted-by":"crossref","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 49, 40\u201350 (2007)","journal-title":"Networks"},{"issue":"12","key":"9867_CR7","doi-asserted-by":"crossref","first-page":"2536","DOI":"10.1109\/TVCG.2011.202","volume":"17","author":"K. Verbeek","year":"2011","unstructured":"Verbeek, K., Buchin, K., Speckmann, B.: Flow map layout via spiral trees. IEEE Trans. Vis. Comput. Graph. 17(12), 2536\u20132544 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"9867_CR8","unstructured":"C\u00f3rdova, J., Lee, Y.: A heuristic algorithm for the rectilinear Steiner arborescence problem. Technical report, Engineering Optimization (1994)"},{"key":"9867_CR9","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":"6","key":"9867_CR10","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/TVCG.2009.143","volume":"15","author":"D. Guo","year":"2009","unstructured":"Guo, D.: Flow mapping and multivariate visualization of large spatial interaction data. IEEE Trans. Vis. Comput. Graph. 15(6), 1041\u20131048 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"2","key":"9867_CR11","doi-asserted-by":"crossref","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 Q. 14(2), 159\u2013182 (2006)","journal-title":"Air Traffic Control Q."},{"issue":"3","key":"9867_CR12","doi-asserted-by":"crossref","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. 4(3), 357\u2013363 (2000)","journal-title":"J. Comb. Optim."},{"key":"9867_CR13","doi-asserted-by":"crossref","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 8, 55\u201388 (1992)","journal-title":"Algorithmica"},{"key":"9867_CR14","first-page":"219","volume-title":"Proc. IEEE Symposium on Information Visualization","author":"D. Phan","year":"2005","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":"9867_CR15","doi-asserted-by":"crossref","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. Comput.-Aided Des. Integr. Circuits Syst. 22(7), 859\u2013869 (2003)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"9867_CR16","doi-asserted-by":"crossref","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 7, 277\u2013288 (1992)","journal-title":"Algorithmica"},{"key":"9867_CR17","first-page":"780","volume-title":"Proc. 11th ACM-SIAM Symposium on Discrete Algorithms","author":"W. Shi","year":"2000","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":"9867_CR18","doi-asserted-by":"crossref","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. 35(3), 729\u2013740 (2005)","journal-title":"SIAM J. Comput."},{"key":"9867_CR19","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":"9867_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1559\/152304087783875273","volume":"14","author":"W. Tobler","year":"1987","unstructured":"Tobler, W.: Experiments in migration mapping by computer. Am. Cartogr. 14(2), 155\u2013163 (1987)","journal-title":"Am. Cartogr."},{"issue":"2","key":"9867_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1179\/000870410X12658023467367","volume":"47","author":"J. Wood","year":"2010","unstructured":"Wood, J., Dykes, J., Slingsby, A.: Visualization of origins, destinations and flows with OD maps. Cartogr. J. 47(2), 117\u2013129 (2010)","journal-title":"Cartogr. J."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9867-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9867-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9867-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:52:18Z","timestamp":1565131938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9867-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,23]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9867"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9867-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,23]]}}}