{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:53:50Z","timestamp":1743144830784,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_36","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"448-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Restricted 1-Steiner Tree Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1825-0097","authenticated-orcid":false,"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Anthony","family":"D\u2019Angelo","sequence":"additional","affiliation":[]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Aurenhammer, F., Klein, R., Lee, D.: Voronoi Diagrams and Delaunay Triangulations. World Scientific (2013)","DOI":"10.1142\/8685"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_9"},{"key":"36_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"issue":"2&3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01758760","volume":"7","author":"RS Booth","year":"1992","unstructured":"Booth, R.S., Weng, J.F.: Steiner minimal trees for a class of zigzag lines. Algorithmica 7(2&3), 231\u2013246 (1992)","journal-title":"Algorithmica"},{"issue":"3","key":"36_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.comgeo.2004.04.003","volume":"29","author":"P Bose","year":"2004","unstructured":"Bose, P., Maheshwari, A., Narasimhan, G., Smid, M.H.M., Zeh, N.: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3), 233\u2013249 (2004)","journal-title":"Comput. Geom."},{"key":"36_CR6","unstructured":"Brazil, M., Cole, T., Rubinstein, J.H., Thomas, D.A., Weng, J.F., Wormald, N.C.: Minimal Steiner trees for $${2}^{\\text{k}} \\times {2}^{\\rm k}$$ square lattices. J. Comb. Theory Ser. A 73(1), 91\u2013110 (1996)"},{"issue":"3","key":"36_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00407-013-0127-z","volume":"68","author":"M Brazil","year":"2014","unstructured":"Brazil, M., Graham, R.L., Thomas, D.A., Zachariasen, M.: On the history of the Euclidean Steiner tree problem. Arch. Hist. Exact Sci. 68(3), 327\u2013354 (2014)","journal-title":"Arch. Hist. Exact Sci."},{"issue":"1","key":"36_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s00453-013-9780-5","volume":"71","author":"M Brazil","year":"2015","unstructured":"Brazil, M., Ras, C.J., Swanepoel, K.J., Thomas, D.A.: Generalised k-Steiner tree problems in normed planes. Algorithmica 71(1), 66\u201386 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"36_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jcta.1996.2752","volume":"78","author":"M Brazil","year":"1997","unstructured":"Brazil, M., Rubinstein, J.H., Thomas, D.A., Weng, J.F., Wormald, N.C.: Full minimal Steiner trees on lattice sets. J. Comb. Theory Ser. A 78(1), 51\u201391 (1997)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"36_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1006\/jcta.1996.2751","volume":"79","author":"M Brazil","year":"1997","unstructured":"Brazil, M., Rubinstein, J.H., Thomas, D.A., Weng, J.F., Wormald, N.C.: Minimal Steiner trees for rectangular arrays of lattice points. J. Comb. Theory Ser. A 79(2), 181\u2013208 (1997)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"36_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1009846620554","volume":"4","author":"M Brazil","year":"2000","unstructured":"Brazil, M., Thomas, D.A., Weng, J.F.: On the complexity of the Steiner problem. J. Comb. Optim. 4(2), 187\u2013195 (2000)","journal-title":"J. Comb. Optim."},{"key":"36_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13915-910.1007\/978-3-319-13915-9","volume-title":"Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications","author":"M Brazil","year":"2015","unstructured":"Brazil, M., Zachariasen, M.: Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications, vol. 29. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-13915-910.1007\/978-3-319-13915-9"},{"issue":"5","key":"36_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0020-0190(90)90054-2","volume":"35","author":"M Chang","year":"1990","unstructured":"Chang, M., Huang, N., Tang, C.Y.: An optimal algorithm for constructing oriented Voronoi diagrams and geographic neighborhood graphs. Inf. Process. Lett. 35(5), 255\u2013260 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"36_CR14","first-page":"76","volume":"25","author":"B Chazelle","year":"1985","unstructured":"Chazelle, B., Guibas, L.J., Lee, D.T.: The power of geometric duality. BIT Comput. Sci. Sect. 25(1), 76\u201390 (1985)","journal-title":"BIT Comput. Sci. Sect."},{"issue":"9","key":"36_CR15","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/S0305-0548(99)00061-1","volume":"27","author":"G Chen","year":"2000","unstructured":"Chen, G., Zhang, G.: A constrained minimum spanning tree problem. Comput. Oper. Res. 27(9), 867\u2013875 (2000)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"36_CR16","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"DR Cheriton","year":"1976","unstructured":"Cheriton, D.R., Tarjan, R.E.: Finding minimum spanning trees. SIAM J. Comput. 5(4), 724\u2013742 (1976)","journal-title":"SIAM J. Comput."},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Chew, L.P., Dyrsdale III, R.L.: Voronoi diagrams based on convex distance functions. In: Symposium on Computational Geometry, pp. 235\u2013244. ACM (1985)","DOI":"10.1145\/323233.323264"},{"issue":"1","key":"36_CR18","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1111\/j.1749-6632.1985.tb14564.x","volume":"440","author":"FRK Chung","year":"1985","unstructured":"Chung, F.R.K., Graham, R.L.: A new bound for Euclidean Steiner minimal trees. Ann. N. Y. Acad. Sci. 440(1), 328\u2013346 (1985)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0167-5060(08)70332-7","volume":"2","author":"F Chung","year":"1978","unstructured":"Chung, F., Graham, R.: Steiner trees for ladders. Ann. Discret. Math. 2, 173\u2013200 (1978)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"36_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1090\/S0002-9947-1983-0697066-5","volume":"278","author":"D Du","year":"1983","unstructured":"Du, D., Hwang, F., Weng, J.: Steiner minimal trees on zig-zag lines. Trans. Am. Math. Soc. 278(1), 149\u2013156 (1983)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"36_CR21","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0222031","volume":"22","author":"H Edelsbrunner","year":"1993","unstructured":"Edelsbrunner, H., Seidel, R., Sharir, M.: On the zone theorem for hyperplane arrangements. SIAM J. Comput. 22(2), 418\u2013429 (1993)","journal-title":"SIAM J. Comput."},{"key":"36_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"issue":"4","key":"36_CR23","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32(4), 835\u2013859 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"36_CR24","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/0196-6774(87)90032-0","volume":"8","author":"GK Georgakopoulos","year":"1987","unstructured":"Georgakopoulos, G.K., Papadimitriou, C.H.: The 1-Steiner tree problem. J. Algorithms 8(1), 122\u2013130 (1987)","journal-title":"J. Algorithms"},{"issue":"1","key":"36_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E Gilbert","year":"1968","unstructured":"Gilbert, E., Pollak, H.: Steiner minimal trees. SIAM J. Appl. Math. 16(1), 1\u201329 (1968)","journal-title":"SIAM J. Appl. Math."},{"key":"36_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-83539-1_4","volume-title":"Theoretical Foundations of Computer Graphics and CAD","author":"LJ Guibas","year":"1988","unstructured":"Guibas, L.J., Stolfi, J.: Ruler, compass and computer. In: Earnshaw, R.A. (ed.) Theoretical Foundations of Computer Graphics and CAD, pp. 111\u2013165. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/978-3-642-83539-1_4"},{"issue":"2","key":"36_CR27","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"36_CR28","first-page":"7","volume":"18","author":"J Holby","year":"2017","unstructured":"Holby, J.: Variations on the Euclidean Steiner tree problem and algorithms. Rose-Hulman Undergraduate Math. J. 18(1), 7 (2017)","journal-title":"Rose-Hulman Undergraduate Math. J."},{"issue":"2","key":"36_CR29","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/s10878-019-00492-0","volume":"39","author":"J Li","year":"2020","unstructured":"Li, J., Liu, S., Lichen, J., Wang, W., Zheng, Y.: Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem. J. Comb. Optim. 39(2), 492\u2013508 (2020)","journal-title":"J. Comb. Optim."},{"key":"36_CR30","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"CL Monma","year":"1992","unstructured":"Monma, C.L., Suri, S.: Transitions in geometric minimum spanning trees. Discret. Comput. Geom. 8, 265\u2013293 (1992)","journal-title":"Discret. Comput. Geom."},{"key":"36_CR31","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry - An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Texts and Monographs in Computer Science. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"issue":"6","key":"36_CR32","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1002\/net.3230220604","volume":"22","author":"JH Rubinstein","year":"1992","unstructured":"Rubinstein, J.H., Thomas, D.A., Weng, J.F.: Degree-five Steiner points cannot reduce network costs for planar sets. Networks 22(6), 531\u2013537 (1992)","journal-title":"Networks"},{"issue":"1","key":"36_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480192241190","volume":"10","author":"JH Rubinstein","year":"1997","unstructured":"Rubinstein, J.H., Thomas, D.A., Wormald, N.C.: Steiner trees for terminals constrained to curves. SIAM J. Discret. Math. 10(1), 1\u201317 (1997)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"36_CR34","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"36_CR35","unstructured":"Shamos, M.: Computational geometry, Ph.D. thesis (1978)"},{"issue":"5","key":"36_CR36","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1111\/cgf.12437","volume":"33","author":"J Vanek","year":"2014","unstructured":"Vanek, J., Galicia, J.A.G., Benes, B.: Clever support: efficient support structure generation for digital fabrication. Comput. Graph. Forum 33(5), 117\u2013125 (2014)","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"36_CR37","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-218X(93)90092-3","volume":"47","author":"P Winter","year":"1993","unstructured":"Winter, P.: Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs. Discret. Appl. Math. 47(2), 187\u2013206 (1993)","journal-title":"Discret. Appl. Math."},{"key":"36_CR38","unstructured":"Winter, P.: Euclidean Steiner minimum trees for 3 terminals in a simple polygon. In: Proceedings of the Seventh Canadian Conference on Computational Geometry, Univ. Laval, Quebec, Canada, pp. 247\u2013255 (1995)"},{"key":"36_CR39","unstructured":"Winter, P.: Steiner minimum trees in simple polygons. DIMACS Technical Report 95-43 (1995)"},{"issue":"1\u20132","key":"36_CR40","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(01)00256-6","volume":"118","author":"P Winter","year":"2002","unstructured":"Winter, P., Zachariasen, M., Nielsen, J.: Short trees in polygons. Discret. Appl. Math. 118(1\u20132), 55\u201372 (2002)","journal-title":"Discret. Appl. Math."},{"key":"36_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-48518-X_17","volume-title":"Algorithm Engineering and Experimentation","author":"M Zachariasen","year":"1999","unstructured":"Zachariasen, M., Winter, P.: Obstacle-avoiding Euclidean Steiner trees in the plane: an exact algorithm. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol. 1619, pp. 282\u2013295. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48518-X_17"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:39:50Z","timestamp":1619242790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}