{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:25:44Z","timestamp":1774333544396,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_26","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:06Z","timestamp":1770977226000},"page":"386-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0MST-Ratio: Theoretical Bounds and\u00a0Complexity of\u00a0Finding the\u00a0Maximum"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5620-9039","authenticated-orcid":false,"given":"Afrouz","family":"Jabal Ameli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8805-9307","authenticated-orcid":false,"given":"Faezeh","family":"Motiei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4201-5775","authenticated-orcid":false,"given":"Morteza","family":"Saghafian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"PK Agarwal","year":"1991","unstructured":"Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. Disc. Comput. Geometry 6(3), 407\u2013422 (1991). https:\/\/doi.org\/10.1007\/BF02574698","journal-title":"Disc. Comput. Geometry"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1214\/aoap\/1177005773","volume":"2","author":"F Avram","year":"1992","unstructured":"Avram, F., Bertsimas, D.: The minimum spanning tree constant in geometrical probability and under the independent model: a unified approach. Ann. Appl. Prob. 2, 113\u2013130 (1992)","journal-title":"Ann. Appl. Prob."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J Beardwood","year":"1959","unstructured":"Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Math. Proc. Cambridge Philos. Soc. 55, 299\u2013327 (1959)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: algorithms and Applications. Springer, 3 edn. (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"26_CR5","first-page":"1","volume":"13","author":"S Bernstein","year":"1912","unstructured":"Bernstein, S.: D\u00e9monstration du th\u00e9or\u00e8me de weierstrass fond\u00e9e sur le calcul des probabilit\u00e9s. Commun. Kharkov Math. Soc. 13, 1\u20132 (1912)","journal-title":"Commun. Kharkov Math. Soc."},{"key":"26_CR6","unstructured":"Biswas, R., Cultrera\u00a0di Montesano, S., Draganov, O., Edelsbrunner, H., Saghafian, M.: On the size of chromatic delaunay mosaics. arXiv:2212.03121 (2022)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K., Graham, R.L.: A new bound for Euclidean Steiner minimal trees. In: Discrete Geometry and Convexity, pp. 328\u2013346. Annals of the New York Academy of Sciences (1985)","DOI":"10.1111\/j.1749-6632.1985.tb14564.x"},{"key":"26_CR8","unstructured":"Cormen, T., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, 3 edn. (2009)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF01210722","volume":"49","author":"BV Dekster","year":"1987","unstructured":"Dekster, B.V., Wilker, J.B.: Edge-lengths guaranteed to form a simplex. Arch. Math. 49, 351\u2013366 (1987)","journal-title":"Arch. Math."},{"key":"26_CR10","unstructured":"Draganov, O., Saghafian, M.: Private communication (2024)"},{"key":"26_CR11","unstructured":"Dumitrescu, A., Pach, J., T\u00f3th, G.: Two trees are better than one. arXiv:2312.09916 (2023)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0113021","volume":"13","author":"EN Gilbert","year":"1965","unstructured":"Gilbert, E.N.: Random minimal trees. J. Soc. Ind. Appl. Math. 13, 376\u2013387 (1965)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"EN Gilbert","year":"1968","unstructured":"Gilbert, E.N., Pollack, H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16, 1\u201329 (1968)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"26_CR14","first-page":"177","volume":"4","author":"RL Graham","year":"1976","unstructured":"Graham, R.L., Hwang, F.K.: Remarks on Steiner minimal trees. Bull. Inst. Math. Academia Sinica 4(1), 177\u2013182 (1976)","journal-title":"Bull. Inst. Math. Academia Sinica"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Koralov, L., Sinai, Y.: Theory of probability and random processes. Springer, 2 edn. (2007)","DOI":"10.1007\/978-3-540-68829-7"},{"key":"26_CR16","unstructured":"Cultrera\u00a0di Montesano, S., Draganov, O., Edelsbrunner, H., Saghafian, M.: The euclidean mst-ratio for bi-colored lattices. In: Symposium on Graph Drawing and Network Visualization (2024)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Cultrera\u00a0di Montesano, S., Draganov, O., Edelsbrunner, H., Saghafian, M.: Chromatic alpha complexes. Found. Data Sci. (2025)","DOI":"10.3934\/fods.2025003"},{"issue":"6","key":"26_CR18","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"8","key":"26_CR19","first-page":"565","volume":"2","author":"G Thiyagarajan","year":"2014","unstructured":"Thiyagarajan, G., Saravanan, M.: Path double covering number of a graph. Int. J. Math. Comput. Res. 2(8), 565\u2013573 (2014)","journal-title":"Int. J. Math. Comput. Res."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:05:46Z","timestamp":1774325146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","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":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}