{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T23:05:12Z","timestamp":1783897512324,"version":"3.55.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032222206","type":"print"},{"value":"9783032222213","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-3-032-22221-3_26","type":"book-chapter","created":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T22:36:34Z","timestamp":1783895794000},"page":"237-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Algorithm for\u00a0Minimal Complete Pareto Front of\u00a0a\u00a0Biobjective Minimum Spanning Trees Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1833-8184","authenticated-orcid":false,"given":"Lasko M.","family":"Laskov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9544-819X","authenticated-orcid":false,"given":"Marin L.","family":"Marinov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,3]]},"reference":[{"issue":"6","key":"26_CR1","doi-asserted-by":"publisher","first-page":"3435","DOI":"10.1111\/itor.13120","volume":"29","author":"L Amorosi","year":"2022","unstructured":"Amorosi, L., Puerto, J.: Two-phase strategies for the bi-objective minimum spanning tree problem. Int. Trans. Oper. Res. 29(6), 3435\u20133463 (2022). https:\/\/doi.org\/10.1111\/itor.13120","journal-title":"Int. Trans. Oper. Res."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BF00938448","volume":"45","author":"HW Corley","year":"1985","unstructured":"Corley, H.W.: Efficient spanning trees. J. Optim. Theory Appl. 45, 481\u2013485 (1985). https:\/\/doi.org\/10.1007\/BF00938448","journal-title":"J. Optim. Theory Appl."},{"key":"26_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, chap.\u00a021, pp. 585\u2013603. MIT Press, Cambridge, Massachusetts, 4th edn. (2022)"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1051\/ro\/2014029","volume":"49","author":"EG de Sousa","year":"2014","unstructured":"de Sousa, E.G., Santos, A.C., Aloise, D.J.: An exact method for solving the bi-objective minimum diameter-cost spanning tree problem. RAIRO-Oper. Res. 49(1), 143\u2013160 (2014). https:\/\/doi.org\/10.1051\/ro\/2014029","journal-title":"RAIRO-Oper. Res."},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/bf01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/bf01386390","journal-title":"Numer. Math."},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987). https:\/\/doi.org\/10.1145\/28869.28874","journal-title":"J. ACM"},{"key":"26_CR7","doi-asserted-by":"publisher","unstructured":"Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7(1), 43\u201357 (1985). https:\/\/doi.org\/10.1109\/MAHC.1985.10011","DOI":"10.1109\/MAHC.1985.10011"},{"key":"26_CR8","doi-asserted-by":"publisher","unstructured":"Knowles, J.D., Corne, D.W.: A comparison of encodings and algorithms for multiobjective minimum spanning tree problems. In: Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), vol.\u00a01, pp. 544\u2013551. IEEE, Piscataway, NJ (2001). https:\/\/doi.org\/10.1109\/CEC.2001.934439","DOI":"10.1109\/CEC.2001.934439"},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Korte, B., Vygen, J.: Spanning Trees and Arborescences, pp. 133\u2013157. Springer Berlin Heidelberg, Berlin, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-56039-6_6","DOI":"10.1007\/978-3-662-56039-6_6"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Ne\u0161et\u0159il, J., Milkov\u00e1, E., Ne\u0161et\u0159ilov\u00e1, H.: O. Bor\u016fvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Math. 233(1), 3\u201336 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00224-7","DOI":"10.1016\/S0012-365X(00)00224-7"},{"issue":"6","key":"26_CR12","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). https:\/\/doi.org\/10.1002\/j.1538-7305.1957.tb01515.x","journal-title":"Bell Syst. Tech. J."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10898-013-0124-4","volume":"60","author":"AC Santos","year":"2014","unstructured":"Santos, A.C., Lima, D.R., Aloise, D.J.: Modeling and solving the bi-objective minimum diameter-cost spanning tree problem. J. Global Optim. 60, 195\u2013216 (2014). https:\/\/doi.org\/10.1007\/s10898-013-0124-4","journal-title":"J. Global Optim."},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.cor.2006.02.023","volume":"35","author":"S Steiner","year":"2008","unstructured":"Steiner, S., Radzik, T.: Computing all efficient solutions of the biobjective minimum spanning tree problem. Comput. Oper. Res. 35(1), 198\u2013211 (2008). https:\/\/doi.org\/10.1016\/j.cor.2006.02.023","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22221-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T22:36:34Z","timestamp":1783895794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22221-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032222206","9783032222213"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22221-3_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":"3 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LSSC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Large-Scale Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sozopol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lssc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parallel.bas.bg\/Conferences\/SciCom25\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}