{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:40:09Z","timestamp":1743572409322,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031856990"},{"type":"electronic","value":"9783031857003"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-85700-3_19","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T04:59:09Z","timestamp":1743569949000},"page":"261-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Phase Distributed Algorithm for\u00a0Solving the\u00a0Bi-Objective Minimum Spanning Tree Problem: A Preliminary Study"],"prefix":"10.1007","author":[{"given":"Lavinia","family":"Amorosi","sequence":"first","affiliation":[]},{"given":"Mariagrazia","family":"Cairo","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Dell\u2019Olmo","sequence":"additional","affiliation":[]},{"given":"Lorenzo","family":"Di Rocco","sequence":"additional","affiliation":[]},{"given":"Umberto","family":"Ferraro Petrillo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","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. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1111\/itor.13120","DOI":"10.1111\/itor.13120"},{"key":"19_CR2","unstructured":"Apache Software Foundation: Apache Spark (2016). http:\/\/spark.apache.org"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Chaabane, K., Bouroubi, S., Djellouli, Y.: Parallel implementation of an exact two-phase method for the bi-objective knapsack problem. RAIRO - Oper. Res. 58 (2024). https:\/\/doi.org\/10.1051\/ro\/2024125","DOI":"10.1051\/ro\/2024125"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51, 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Hamacher, H.W., Ruhe, G.: On spanning tree problems with multiple objectives. Ann. Oper. Res. 52, 209\u2013230 (1994). https:\/\/api.semanticscholar.org\/CorpusID:19142873","DOI":"10.1007\/BF02032304"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Raith, A., Ehrgott, M.: A two-phase algorithm for the biobjective integer minimum cost flow problem. Comput. Oper. Res. 36(6), 1945\u20131954 (2009). https:\/\/doi.org\/10.1016\/j.cor.2008.06.008. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054808001172","DOI":"10.1016\/j.cor.2008.06.008"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Ramos, R.M., Alonso, S., Sicilia, J., Gonz\u00e1lez, C.: The problem of the optimal biobjective spanning tree. Eur. J. Oper. Res. 111(3), 617\u2013628 (1998). https:\/\/doi.org\/10.1016\/S0377-2217(97)00391-3. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221797003913","DOI":"10.1016\/S0377-2217(97)00391-3"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Santos, J.L., Di Puglia Pugliese, L., Guerriero, F.: A new approach for the multiobjective minimum spanning tree. Comput. Oper. Res. 98, 69\u201383 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.05.007. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054818301205","DOI":"10.1016\/j.cor.2018.05.007"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Steiner, S., Radzik, T.: The problem of the optimal biobjective spanning tree. Comput. Oper. Res. 35(1), 198\u2013211 (2008). https:\/\/doi.org\/10.1016\/j.cor.2006.02.023. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S030505480600061X","DOI":"10.1016\/j.cor.2006.02.023"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-85700-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T04:59:19Z","timestamp":1743569959000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-85700-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031856990","9783031857003"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-85700-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ostrava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2024","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":"ppam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}