{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:39:04Z","timestamp":1743143944530,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030800482"},{"type":"electronic","value":"9783030800499"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80049-9_19","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T18:06:14Z","timestamp":1625162774000},"page":"204-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Placing Green Bridges Optimally, with a Multivariate Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2203-4386","authenticated-orcid":false,"given":"Till","family":"Fluschnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6565-3983","authenticated-orcid":false,"given":"Leon","family":"Kellerhals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Bateni, M., Hajiaghayi, M.T., Marx, D.: Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. J. ACM 58(5), 21:1\u201321:37 (2011). https:\/\/doi.org\/10.1145\/2027216.2027219","key":"19_CR1","DOI":"10.1145\/2027216.2027219"},{"key":"19_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"doi-asserted-by":"publisher","unstructured":"Dahl, G., Johannessen, B.: The 2-path network problem. Networks 43(3), 190\u2013199 (2004). https:\/\/doi.org\/10.1002\/net.20003","key":"19_CR3","DOI":"10.1002\/net.20003"},{"doi-asserted-by":"publisher","unstructured":"Ding, W., Qiu, K.: A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem. Theor. Comput. Sci. 840, 1\u201315 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.12.012","key":"19_CR4","DOI":"10.1016\/j.tcs.2019.12.012"},{"doi-asserted-by":"publisher","unstructured":"Downs, J.A., Horner, M.W., Loraamm, R.W., Anderson, J., Kim, H., Onorato, D.: Strategically locating wildlife crossing structures for Florida panthers using maximal covering approaches. Trans. GIS 18(1), 46\u201365 (2014). https:\/\/doi.org\/10.1111\/tgis.12005","key":"19_CR5","DOI":"10.1111\/tgis.12005"},{"doi-asserted-by":"publisher","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90059-1","key":"19_CR6","DOI":"10.1016\/0304-3975(76)90059-1"},{"doi-asserted-by":"publisher","unstructured":"Gassner, E.: The Steiner forest problem revisited. J. Discrete Algorithms 8(2), 154\u2013163 (2010). https:\/\/doi.org\/10.1016\/j.jda.2009.05.002","key":"19_CR7","DOI":"10.1016\/j.jda.2009.05.002"},{"issue":"4","key":"19_CR8","first-page":"5","volume":"39","author":"CP Gomes","year":"2009","unstructured":"Gomes, C.P.: Computational sustainability: computational methods for a sustainable environment, economy, and society. Bridge 39(4), 5\u201313 (2009)","journal-title":"Bridge"},{"doi-asserted-by":"crossref","unstructured":"Huijser, M.P., Duffield, J.W., Clevenger, A.P., Ament, R.J., McGowen, P.T.: Cost\u2013benefit analyses of mitigation measures aimed at reducing collisions with large ungulates in the United States and Canada: a decision support tool. Ecol. Soc. 14(2) (2009). http:\/\/www.jstor.org\/stable\/26268301","key":"19_CR9","DOI":"10.5751\/ES-03000-140215"},{"unstructured":"Huijser, M.P., et al.: Wildlife-vehicle collision reduction study: report to congress. (2008). https:\/\/www.fhwa.dot.gov\/publications\/research\/safety\/08034\/08034.pdf","key":"19_CR10"},{"doi-asserted-by":"publisher","unstructured":"Kerivin, H., Mahjoub, A.R.: Design of survivable networks: a survey. Networks 46(1), 1\u201321 (2005). https:\/\/doi.org\/10.1002\/net.20072","key":"19_CR11","DOI":"10.1002\/net.20072"},{"unstructured":"Lai, K.J., Gomes, C.P., Schwartz, M.K., McKelvey, K.S., Calkin, D.E., Montgomery, C.A.: The Steiner multigraph problem: wildlife corridor design for multiple species. In: Proceedings of 25th AAAI. AAAI Press (2011). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI11\/paper\/view\/3768","key":"19_CR12"},{"doi-asserted-by":"publisher","unstructured":"Loraamm, R.W., Downs, J.A.: A wildlife movement approach to optimally locate wildlife crossing structures. Int. J. Geogr. Inf. Sci. 30(1), 74\u201388 (2016). https:\/\/doi.org\/10.1080\/13658816.2015.1083995","key":"19_CR13","DOI":"10.1080\/13658816.2015.1083995"},{"doi-asserted-by":"publisher","unstructured":"Plesn\u00edk, J.: The complexity of designing a network with minimum diameter. Networks 11(1), 77\u201385 (1981). https:\/\/doi.org\/10.1002\/net.3230110110","key":"19_CR14","DOI":"10.1002\/net.3230110110"},{"doi-asserted-by":"publisher","unstructured":"Ravi, R., Sundaram, R., Marathe, M.V., Rosenkrantz, D.J., Ravi, S.S.: Spanning trees - short or small. SIAM J. Discret. Math. 9(2), 178\u2013200 (1996). https:\/\/doi.org\/10.1137\/S0895480194266331","key":"19_CR15","DOI":"10.1137\/S0895480194266331"},{"doi-asserted-by":"publisher","unstructured":"Richey, M.B., Parker, R.G.: On multiple Steiner subgraph problems. Networks 16(4), 423\u2013438 (1986). https:\/\/doi.org\/10.1002\/net.3230160408","key":"19_CR16","DOI":"10.1002\/net.3230160408"},{"doi-asserted-by":"crossref","unstructured":"Sawaya, M.A., Kalinowski, S.T., Clevenger, A.P.: Genetic connectivity for two bear species at wildlife crossing structures in Banff national park. Proc. Royal Soc. B: Biol. Sci. 281(1780), 20131705 (2014). https:\/\/www.ncbi.nlm.nih.gov\/pmc\/articles\/PMC4027379\/","key":"19_CR17","DOI":"10.1098\/rspb.2013.1705"},{"doi-asserted-by":"publisher","unstructured":"Zheng, R., Luo, Z., Yan, B.: Exploiting time-series image-to-image translation to expand the range of wildlife habitat analysis. In: Proceedings of 33rd AAAI, pp. 825\u2013832. AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.3301825","key":"19_CR18","DOI":"10.1609\/aaai.v33i01.3301825"}],"container-title":["Lecture Notes in Computer Science","Connecting with Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80049-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T17:05:51Z","timestamp":1638810351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80049-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030800482","9783030800499"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80049-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cie2021.ugent.be\/","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":"50","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":"28","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":"56% - 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":"3","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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}