{"id":"https://openalex.org/W4385317011","doi":"https://doi.org/10.1007/978-3-031-38906-1_10","title":"Online Minimum Spanning Trees with Weight Predictions","display_name":"Online Minimum Spanning Trees with Weight Predictions","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4385317011","doi":"https://doi.org/10.1007/978-3-031-38906-1_10"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-38906-1_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-38906-1_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2302.12029.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058385896","display_name":"M. van den Berg","orcid":"https://orcid.org/0000-0001-8637-7113"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Magnus Berg","raw_affiliation_strings":["University of Southern Denmark, Odense, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068354624","display_name":"Joan Boyar","orcid":"https://orcid.org/0000-0002-0725-8341"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Joan Boyar","raw_affiliation_strings":["University of Southern Denmark, Odense, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023065140","display_name":"Lene M. Favrholdt","orcid":"https://orcid.org/0000-0003-3054-2997"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lene M. Favrholdt","raw_affiliation_strings":["University of Southern Denmark, Odense, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000210653","display_name":"Kim S. Larsen","orcid":"https://orcid.org/0000-0003-0560-3794"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kim S. Larsen","raw_affiliation_strings":["University of Southern Denmark, Odense, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5058385896"],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.8593,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.86488509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"136","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7538837790489197},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6480255722999573},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6248252987861633},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5049555897712708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49650245904922485},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.47844555974006653},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47228795289993286},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.43650099635124207},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4329240918159485},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4265623092651367},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36767375469207764},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2234748899936676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22089573740959167},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20189175009727478},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1374577283859253},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.09683504700660706}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7538837790489197},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6480255722999573},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6248252987861633},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5049555897712708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49650245904922485},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.47844555974006653},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47228795289993286},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.43650099635124207},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4329240918159485},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4265623092651367},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36767375469207764},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2234748899936676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22089573740959167},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20189175009727478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1374577283859253},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.09683504700660706},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-031-38906-1_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-38906-1_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:sdu.dk:publications/1eb89f2c-79eb-46f0-9ab0-b77430331989","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/1eb89f2c-79eb-46f0-9ab0-b77430331989","pdf_url":"https://arxiv.org/pdf/2302.12029.pdf","source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Berg, M, Boyar, J, Favrholdt, L M & Larsen, K S 2023, Online Minimum Spanning Trees with Weight Predictions. in P Morin & S Suri (eds), Algorithms and Data Structures. Springer, Lecture Notes in Computer Science, vol. 14079, pp. 136-148. https://doi.org/10.1007/978-3-031-38906-1_10","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:sdu.dk:openaire/1eb89f2c-79eb-46f0-9ab0-b77430331989","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/files/239661637/BBFL.pdf","pdf_url":"https://findresearcher.sdu.dk/ws/files/239661637/BBFL.pdf","source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Berg, M, Boyar, J, Favrholdt, L M & Larsen, K S 2023, Online Minimum Spanning Trees with Weight Predictions. in P Morin & S Suri (eds), Algorithms and Data Structures. Springer, Lecture Notes in Computer Science, vol. 14079, pp. 136-148. https://doi.org/10.1007/978-3-031-38906-1_10","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:sdu.dk:publications/1eb89f2c-79eb-46f0-9ab0-b77430331989","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/1eb89f2c-79eb-46f0-9ab0-b77430331989","pdf_url":"https://arxiv.org/pdf/2302.12029.pdf","source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Berg, M, Boyar, J, Favrholdt, L M & Larsen, K S 2023, Online Minimum Spanning Trees with Weight Predictions. in P Morin & S Suri (eds), Algorithms and Data Structures. Springer, Lecture Notes in Computer Science, vol. 14079, pp. 136-148. https://doi.org/10.1007/978-3-031-38906-1_10","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6899999976158142}],"awards":[{"id":"https://openalex.org/G4782604025","display_name":null,"funder_award_id":"9142-00001B","funder_id":"https://openalex.org/F4320313796","funder_display_name":"Innovationsfonden"}],"funders":[{"id":"https://openalex.org/F4320313796","display_name":"Innovationsfonden","ror":"https://ror.org/00daj4111"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385317011.pdf","grobid_xml":"https://content.openalex.org/works/W4385317011.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1554718677","https://openalex.org/W2011670396","https://openalex.org/W2017441966","https://openalex.org/W2041645394","https://openalex.org/W2109659895","https://openalex.org/W2112906671","https://openalex.org/W2468711194","https://openalex.org/W2606892140","https://openalex.org/W2626350546","https://openalex.org/W2809834751","https://openalex.org/W2964190949","https://openalex.org/W3034803276","https://openalex.org/W3128026047","https://openalex.org/W3175419663","https://openalex.org/W3178731179","https://openalex.org/W6607799965"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2387385213","https://openalex.org/W2074214908","https://openalex.org/W4242086819","https://openalex.org/W4302939663","https://openalex.org/W2138987445","https://openalex.org/W1842018596"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}