{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:03:56Z","timestamp":1742933036369,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031545337"},{"type":"electronic","value":"9783031545344"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-54534-4_24","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:39:18Z","timestamp":1710844758000},"page":"341-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Problem of\u00a0Finding Several Given Diameter Spanning Trees of Maximum Total Weight in\u00a0a\u00a0Complete Graph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1349-405X","authenticated-orcid":false,"given":"E. Kh.","family":"Gimadi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7664-5049","authenticated-orcid":false,"given":"A. A.","family":"Shtepa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"issue":"1","key":"24_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), 1\u201333 (2012). https:\/\/doi.org\/10.1007\/s00493-012-2552-z","journal-title":"Combinatorica"},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Bala, K., Petropoulos, K., Stern, T.E.: Multicasting in a linear Lightwave network. In: Proceedings of the IEEE INFOCOM 1993, pp. 1350\u20131358 (1993). https:\/\/doi.org\/10.1109\/INFCOM.1993.253399","DOI":"10.1109\/INFCOM.1993.253399"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0306-4379(91)90030-D","volume":"16","author":"A Bookstein","year":"1991","unstructured":"Bookstein, A., Klein, S.T.: Compression of correlated bit-vectors. Inform. Syst. 16(4), 387\u2013400 (1991)","journal-title":"Inform. Syst."},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Clementi, A.E.F., Ianni, M.D., Monti, A., Rossi, G., Silvestri, R.: Experimental analysis of practically efficient algorithms for bounded-hop accumulation in ad-hoc wireless networks. In: Proceedings of the 19th IEEE International Parallel Distributed Processing Symposium (IPDPS 2005), pp. 8\u201316 (2005). https:\/\/doi.org\/10.1109\/IPDPS.2005.210","DOI":"10.1109\/IPDPS.2005.210"},{"issue":"1","key":"24_CR5","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). https:\/\/doi.org\/10.1017\/S0963548315000024","journal-title":"Comb. Probab. Comput."},{"key":"24_CR6","first-page":"70","volume":"27","author":"AI Erzin","year":"1987","unstructured":"Erzin, A.I.: The problem of constructing a spanning tree of maximal weight with a bounded radius. Upravlyaemye Sistemy, iss. 27, 70\u201378 (1987). (in Russian)","journal-title":"Upravlyaemye Sistemy, iss."},{"issue":"1","key":"24_CR7","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(1), 47\u201356 (1985). https:\/\/doi.org\/10.1016\/0166-218X(85)90058-7","journal-title":"Discret. Appl. Math."},{"key":"24_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, p. 340. Freeman, San Francisco (1979)"},{"key":"24_CR9","first-page":"35","volume":"31","author":"EK Gimadi","year":"1975","unstructured":"Gimadi, E.K., Glebov, N.I., Perepelitsa, V.A.: Algorithms with estimates for discrete optimization problems. Problemy Kibernetiki, iss. 31, 35\u201342 (1975). (in Russian)","journal-title":"Problemy Kibernetiki, iss."},{"key":"24_CR10","unstructured":"Gimadi, E. K., Istomin, A.M., Shin, E.Y.: On algorithm for the minimum spanning tree problem bounded below. In: Proceedings of the DOOR 2016, Vladivostok, Russia, 19\u201323 September 2016, CEUR-WS, 1623, pp. 11\u201317 (2016)"},{"key":"24_CR11","unstructured":"Gimadi, E.K., Istomin, A.M., Shin, E.Y.: On given diameter MST problem on random instances. In: CEUR Workshop Proceedings, pp. 159\u2013168 (2019)"},{"key":"24_CR12","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":"24_CR13","doi-asserted-by":"crossref","unstructured":"Gimadi, E.K., Shevyakov, A.S., Shin, E.Y.: Asymptotically optimal approach to a given diameter undirected MST problem on random instances. In: 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":"24_CR14","first-page":"53","volume":"57","author":"EK Gimadi","year":"2022","unstructured":"Gimadi, E.K., Shtepa, A.A.: Asymptotically optimal approach for the maximum spanning tree problem with given diameter in a complete undirected graph on UNI(0; 1)-entries. Problems Inform. 57(4), 53\u201362 (2022)","journal-title":"Problems Inform."},{"key":"24_CR15","doi-asserted-by":"publisher","unstructured":"Gimadi, E.K., Shtepa, A.A.: On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter. Autom. Remote Control, 84(7), 872\u2013888 (2023). https:\/\/doi.org\/10.25728\/arcRAS.2023.42.85.001","DOI":"10.25728\/arcRAS.2023.42.85.001"},{"key":"24_CR16","unstructured":"Nadiradze, G.: Bounded Diameter Minimum Spanning Tree, Master thesis, Central European University (2013)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Petrov, V.V.: Limit Theorems of Probability Theory. Sequences of Independent Random Variables, p. 304. Clarendon Press, Oxford (1995)","DOI":"10.1093\/oso\/9780198534990.003.0002"},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61\u201377 (1989). https:\/\/doi.org\/10.1145\/58564.59295","journal-title":"ACM Trans. Comput. Syst."},{"key":"24_CR19","unstructured":"Serdyukov, A.I.: On problem of maximal spanning tree with bounded radius. Diskretn. Anal. Issled. Oper. Ser. 1, 5(3), 64\u201369 (1998). (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54534-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:43:35Z","timestamp":1710845015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54534-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031545337","9783031545344"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54534-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yerevan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Armenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","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":"24","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":"26% - 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":"1.62","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":"Out of the 93 submission, 17 were rejected before being sent to peer review.","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)"}}]}}