{"id":"https://openalex.org/W2952999756","doi":"https://doi.org/10.1007/s00453-022-00944-w","title":"Relaxing the Irrevocability Requirement for Online Graph Algorithms","display_name":"Relaxing the Irrevocability Requirement for Online Graph Algorithms","publication_year":2022,"publication_date":"2022-02-25","ids":{"openalex":"https://openalex.org/W2952999756","doi":"https://doi.org/10.1007/s00453-022-00944-w","mag":"2952999756"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-00944-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-022-00944-w","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://portal.findresearcher.sdu.dk/da/publications/1b4e1848-5aeb-4f30-9f45-b6bc920e454c","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, 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":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011375558","display_name":"Michal Kotrb\u010d\u0131\u0301k","orcid":null},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"The University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Michal Kotrb\u010d\u00edk","raw_affiliation_strings":["School of Mathematics and Physics, The University of Queensland, St Lucia, Brisbane, QLD, 4072, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Physics, The University of Queensland, St Lucia, Brisbane, QLD, 4072, Australia","institution_ids":["https://openalex.org/I165143802"]}]},{"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":true,"raw_author_name":"Kim S. Larsen","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-0560-3794","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000210653"],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.6796,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.67301748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"84","issue":"7","first_page":"1916","last_page":"1951"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9951000213623047,"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/T11182","display_name":"Auction Theory and Applications","score":0.9932000041007996,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.671533465385437},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.579925537109375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5570656061172485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5425648093223572},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5401912927627563},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5245402455329895},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5134857296943665},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.44806116819381714},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4379411041736603},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4267508387565613},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4194561243057251},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4158291518688202},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37595927715301514},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3522096276283264},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2495599389076233},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09808611869812012}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.671533465385437},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.579925537109375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5570656061172485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5425648093223572},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5401912927627563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5245402455329895},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5134857296943665},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.44806116819381714},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4379411041736603},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4267508387565613},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4194561243057251},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4158291518688202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37595927715301514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3522096276283264},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2495599389076233},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09808611869812012},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-022-00944-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-022-00944-w","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:openaire/1b4e1848-5aeb-4f30-9f45-b6bc920e454c","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/1b4e1848-5aeb-4f30-9f45-b6bc920e454c","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Boyar, J, Favrholdt, L M, Kotrb\u010d\u00edk, M & Larsen, K S 2022, 'Relaxing the Irrevocability Requirement for Online Graph Algorithms', Algorithmica, vol. 84, no. 7, pp. 1916-1951. https://doi.org/10.1007/s00453-022-00944-w","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:sdu.dk:openaire/1b4e1848-5aeb-4f30-9f45-b6bc920e454c","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/1b4e1848-5aeb-4f30-9f45-b6bc920e454c","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Boyar, J, Favrholdt, L M, Kotrb\u010d\u00edk, M & Larsen, K S 2022, 'Relaxing the Irrevocability Requirement for Online Graph Algorithms', Algorithmica, vol. 84, no. 7, pp. 1916-1951. https://doi.org/10.1007/s00453-022-00944-w","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.550000011920929}],"awards":[{"id":"https://openalex.org/G1611354016","display_name":null,"funder_award_id":"DFF-7014-00041","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"},{"id":"https://openalex.org/G2664447491","display_name":null,"funder_award_id":"DFF-1323-00247","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"},{"id":"https://openalex.org/G6298695570","display_name":null,"funder_award_id":"VKR023219","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G834198560","display_name":null,"funder_award_id":"DFF-0135-00018B","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"}],"funders":[{"id":"https://openalex.org/F4320310485","display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d","ror":"https://ror.org/03ge1nb22"},{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W112063162","https://openalex.org/W345637930","https://openalex.org/W1489273657","https://openalex.org/W1513400187","https://openalex.org/W1589175915","https://openalex.org/W1590242304","https://openalex.org/W1599161138","https://openalex.org/W1608917902","https://openalex.org/W1973221673","https://openalex.org/W1980280644","https://openalex.org/W1992523338","https://openalex.org/W2011670396","https://openalex.org/W2028468530","https://openalex.org/W2029437526","https://openalex.org/W2041645394","https://openalex.org/W2041839348","https://openalex.org/W2046731583","https://openalex.org/W2070459622","https://openalex.org/W2076855469","https://openalex.org/W2081414879","https://openalex.org/W2082721953","https://openalex.org/W2165753192","https://openalex.org/W2174718091","https://openalex.org/W2259315298","https://openalex.org/W2335836144","https://openalex.org/W2341403126","https://openalex.org/W2469267808","https://openalex.org/W2537728301","https://openalex.org/W2576677780","https://openalex.org/W2611885862","https://openalex.org/W2762990162","https://openalex.org/W2885283474","https://openalex.org/W2893780080","https://openalex.org/W2952359104","https://openalex.org/W2962942578","https://openalex.org/W2963961281","https://openalex.org/W3101104511","https://openalex.org/W4206501214","https://openalex.org/W4251221220","https://openalex.org/W4255288880"],"related_works":["https://openalex.org/W2752015945","https://openalex.org/W2051209951","https://openalex.org/W1493790977","https://openalex.org/W2358378335","https://openalex.org/W3135987664","https://openalex.org/W1996475154","https://openalex.org/W4297052981","https://openalex.org/W1992519595","https://openalex.org/W2081642962","https://openalex.org/W2803566534"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}