{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:09:39Z","timestamp":1742998179326,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030778750"},{"type":"electronic","value":"9783030778767"}],"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-77876-7_5","type":"book-chapter","created":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:03:11Z","timestamp":1623625391000},"page":"67-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Asymptotically Optimal Approach for\u00a0the Problem of Finding Several Edge-Disjoint Spanning Trees of Given Diameter in an Undirected Graph with\u00a0Random Edge Weights"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1349-405X","authenticated-orcid":false,"given":"Edward Kh.","family":"Gimadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandr S.","family":"Shevyakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7664-5049","authenticated-orcid":false,"given":"Alexandr A.","family":"Shtepa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00493-012-2552-z","volume":"32","author":"O Angel","year":"2012","unstructured":"Angel, O., Flaxman, A.D., Wilson, D.B.: A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. Combinatorica 32, 1\u201333 (2012). https:\/\/doi.org\/10.1007\/s00493-012-2552-z","journal-title":"Combinatorica"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1017\/S0963548315000024","volume":"25","author":"C Cooper","year":"2016","unstructured":"Cooper, C., Frieze, A., Ince, N., Janson, S., Spencer, J.: On the length of a random minimum spanning tree. Comb. Probab. Comput. 25(1), 89\u2013107 (2016)","journal-title":"Comb. Probab. Comput."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(85)90058-7","volume":"10","author":"A Frieze","year":"1985","unstructured":"Frieze, A.: On the value of a random MST problem. Discret. Appl. Math. 10, 47\u201356 (1985)","journal-title":"Discret. Appl. Math."},{"key":"5_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979). 340 p."},{"key":"5_CR5","unstructured":"Gimadi, E.Kh., Glebov, N.I., Perepelitsa, V.A.: Algorithms with estimates for discrete optimization problems. Problemy Kibernetiki 31, 35\u201342 (1975). (in Russian)"},{"key":"5_CR6","unstructured":"Gimadi, E.Kh., Istomin, A.M., Shin, E.Yu.: On Algorithm for the minimum spanning tree problem bounded below. In: Proceedings of the DOOR 2016, Vladivostok, Russia, 19\u201323 September 2016, vol. 1623, pp. 11\u201317. CEUR-WS (2016)"},{"key":"5_CR7","unstructured":"Gimadi, E.Kh., Istomin, A.M., Shin, E.Yu.: On given diameter MST problem on random instances. In: CEUR Workshop Proceedings, pp. 159\u2013168 (2019)"},{"key":"5_CR8","unstructured":"Gimadi, E.Kh., Khachay, M.Yu.: Extremal Problems on Sets of Permutations, UrFU Publ., Ekaterinburg (2016). 219 p. (in Russian)"},{"key":"5_CR9","series-title":"Operations Research Proceedings 1999","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-58300-1_12","volume-title":"Operations Research Proceedings 1999","author":"EK Gimadi","year":"2000","unstructured":"Gimadi, E.K., Serdyukov, A.I.: A probabilistic analysis of an approximation algorithm for the minimum weight spanning tree problem with bounded from below diameter. In: Inderfurth, K., Schw\u00f6diauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., W\u00e4scher, G. (eds.) Operations Research Proceedings 1999. ORP, vol. 1999, pp. 63\u201368. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-58300-1_12"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Gimadi, E.Kh., Shevyakov, A.S., Shin, E.Yu.: Asymptotically Optimal Approach to a Given Diameter Undirected MST Problem on Random Instances, Proceedings of 15-th International Asian School-Seminar OPCS-2019, Publisher: IEEE Xplore, pp. 48\u201352 (2019)","DOI":"10.1109\/OPCS.2019.8880223"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1134\/S1990478915040043","volume":"9","author":"EK Gimadi","year":"2015","unstructured":"Gimadi, E.K., Shin, E.Y.: Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below. J. Appl. Ind. Math. 9(4), 480\u2013488 (2015). https:\/\/doi.org\/10.1134\/S1990478915040043","journal-title":"J. Appl. Ind. Math."},{"key":"5_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-030-33394-2_3","volume-title":"Mathematical Optimization Theory and Operations Research","author":"EK Gimadi","year":"2019","unstructured":"Gimadi, E.K., Shin, E.Y.: On given diameter MST problem on random input data. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds.) MOTOR 2019. CCIS, vol. 1090, pp. 30\u201338. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33394-2_3"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-62867-3_9","volume-title":"Optimization and Applications","author":"EK Gimadi","year":"2020","unstructured":"Gimadi, E.K., Shevyakov, A.S., Shtepa, A.A.: A given diameter MST on a random graph. In: Olenev, N., Evtushenko, Y., Khachay, M., Malkova, V. (eds.) OPTIMA 2020. LNCS, vol. 12422, pp. 110\u2013121. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62867-3_9"},{"key":"5_CR14","unstructured":"Gruber M.: Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem, Vienna University of Technology, PhD Thesis (2008)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Petrov, V.V.: Limit Theorems of Probability Theory. Sequences of Independent Random Variables. Clarendon Press, Oxford (1995). 304 p.","DOI":"10.1093\/oso\/9780198534990.003.0002"}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77876-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T19:00:57Z","timestamp":1725217257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77876-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778750","9783030778767"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77876-7_5","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":"14 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Irkutsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","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":"10 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.icc.ru\/e\/motor2021","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":"102","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":"29","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":"1","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":"28% - 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,4","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":"2,5","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)"}}]}}