{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:04:13Z","timestamp":1742925853738,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_25","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"330-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Steiner Problem for Count Matroids"],"prefix":"10.1007","author":[{"given":"Tibor","family":"Jord\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryoga","family":"Mahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-39658-1_10","volume-title":"Algorithms - ESA 2003","author":"AR Berg","year":"2003","unstructured":"Berg, A.R., Jord\u00e1n, T.: Algorithms for graph rigidity and scene analysis. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 78\u201389. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_10"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvoss, T., Sanita, L.: An improved LP-based approximation ratio for Steiner tree. In: Proceedings of 42nd STOC, pp. 583\u2013592 (2010)","DOI":"10.1145\/1806689.1806769"},{"key":"25_CR3","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. New York Acad. Sci. 440, 328\u2013346 (1985)","journal-title":"Ann. New York Acad. Sci."},{"key":"25_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/6729","volume-title":"Steiner Tree Problems in Computer Communication Networks","author":"D Du","year":"2008","unstructured":"Du, D., Hu, X.: Steiner Tree Problems in Computer Communication Networks. World Scientific Publishing, River Edge (2008)"},{"key":"25_CR5","volume-title":"Connections in Combinatorial Optimization","author":"A Frank","year":"2011","unstructured":"Frank, A.: Connections in Combinatorial Optimization. Oxford University Press, Oxford (2011)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0166-218X(02)00464-X","volume":"131","author":"A Frank","year":"2003","unstructured":"Frank, A., Szeg\u0151, L.: Constructive characterizations for packing and covering with trees. Discrete Appl. Math. 131, 347\u2013371 (2003)","journal-title":"Discrete Appl. Math."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.4018\/978-1-60566-396-8.ch006","volume-title":"Localization Algorithms and Strategies for Wireless Sensor Networks","author":"B Jackson","year":"2009","unstructured":"Jackson, B., Jord\u00e1n, T.: Graph theoretic techniques in the analysis of uniquely localizable sensor networks. In: Mao, G., Fidan, B. (eds.) Localization Algorithms and Strategies for Wireless Sensor Networks, pp. 146\u2013173. IGI Global, Hershey (2009)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0166-218X(02)00465-1","volume":"131","author":"T Jord\u00e1n","year":"2003","unstructured":"Jord\u00e1n, T.: On minimally $$k$$-edge-connected graphs and shortest $$k$$-edge-connected Steiner networks. Discrete Appl. Math. 131, 421\u2013432 (2003)","journal-title":"Discrete Appl. Math."},{"key":"25_CR9","first-page":"33","volume":"34","author":"T Jord\u00e1n","year":"2016","unstructured":"Jord\u00e1n, T.: Combinatorial rigidity: graphs and matroids in the theory of rigid frameworks. Discrete Geom. Anal. MSJ Memoirs 34, 33\u2013112 (2016)","journal-title":"Discrete Geom. Anal. MSJ Memoirs"},{"issue":"4","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1137\/110860872","volume":"27","author":"T Jord\u00e1n","year":"2013","unstructured":"Jord\u00e1n, T., Domokos, G., T\u00f3th, K.: Geometric sensitivity of rigid graphs. SIAM J. Discrete Math 27(4), 1710\u20131726 (2013)","journal-title":"SIAM J. Discrete Math"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Jord\u00e1n, T., Kobayashi, Y., Mahara, R., Makino, K.: The Steiner problem for count matroids, TR-2020-03, Egerv\u00e1ry Research Group, Budapest","DOI":"10.1007\/978-3-030-48966-3_25"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G Laman","year":"1970","unstructured":"Laman, G.: On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4, 331\u2013340 (1970)","journal-title":"J. Eng. Math."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1016\/j.disc.2007.07.104","volume":"308","author":"A Lee","year":"2008","unstructured":"Lee, A., Streinu, I.: Pebble game algorithms and sparse graphs. Disc. Math 308, 1425\u20131437 (2008)","journal-title":"Disc. Math"},{"key":"25_CR14","unstructured":"Lomonosov, A.: Graph and combinatorial algorithms for geometric constraint solving, Ph.D. thesis, U. Florida (2004)"},{"key":"25_CR15","unstructured":"Matroids - girth and co-girth. In: Egres Open, an open problem collection of the Egerv\u00e1ry Research Group, Budapest. lemon.cs.elte.hu\/egres\/open"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Nash-Williams, C.St.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39, 12 (1964)","DOI":"10.1112\/jlms\/s1-39.1.12"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Whiteley, W.: Some matroids from discrete applied geometry. Contemp. Math. 197, 171\u2013311 (1996). In: Matroid theory (Seattle, WA, 1995), Amer. Math. Soc., Providence, RI","DOI":"10.1090\/conm\/197\/02540"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:17:37Z","timestamp":1710256657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_25","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":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","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":"62","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":"30","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":"48% - 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,8","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":"5,9","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)"}},{"value":"The conference had to be postponed 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}