{"id":"https://openalex.org/W2335836144","doi":"https://doi.org/10.1007/s00453-018-0519-1","title":"Online Dominating Set","display_name":"Online Dominating Set","publication_year":2018,"publication_date":"2018-09-25","ids":{"openalex":"https://openalex.org/W2335836144","doi":"https://doi.org/10.1007/s00453-018-0519-1","mag":"2335836144"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0519-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0519-1","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":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.21","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, Odense, Denmark","Department of Mathematics and Computer Science (IMADA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science (IMADA)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073911119","display_name":"Stephan Eidenbenz","orcid":"https://orcid.org/0000-0002-2628-1854"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephan J. Eidenbenz","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos, NM, USA","Los Alamos national Laboratory"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos, NM, USA","institution_ids":["https://openalex.org/I1343871089"]},{"raw_affiliation_string":"Los Alamos national Laboratory","institution_ids":["https://openalex.org/I1343871089"]}]},{"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, Odense, Denmark","Department of Mathematics and Computer Science (IMADA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science (IMADA)","institution_ids":[]}]},{"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, University of Queensland, Brisbane, Australia","Department of Mathematics and Computer Science (IMADA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Physics, University of Queensland, Brisbane, Australia","institution_ids":["https://openalex.org/I165143802"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science (IMADA)","institution_ids":[]}]},{"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, Odense, Denmark","Department of Mathematics and Computer Science (IMADA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science (IMADA)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00929892,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"81","issue":"5","first_page":"1938","last_page":"1964"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.6145661473274231},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5801859498023987},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5349999666213989},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5009458065032959},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4664347171783447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4479571580886841},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44471853971481323},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44299015402793884},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4376167058944702},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4077603220939636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3594675660133362},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3512491285800934},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.327281653881073},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1901542842388153}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6145661473274231},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5801859498023987},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5349999666213989},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5009458065032959},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4664347171783447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4479571580886841},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44471853971481323},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44299015402793884},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4376167058944702},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4077603220939636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3594675660133362},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3512491285800934},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.327281653881073},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1901542842388153},{"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}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/s00453-018-0519-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0519-1","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:drops-oai.dagstuhl.de:6043","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.21","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:sdu.dk:openaire/bba148e6-3d72-4db2-a005-a51bde9e9d57","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/bba148e6-3d72-4db2-a005-a51bde9e9d57","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, Eidenbenz, S J, Favrholdt, L M, Kotrb\u010d\u00edk, M & Larsen, K S 2019, 'Online Dominating Set', Algorithmica, vol. 81, no. 5, pp. 1938-1964. https://doi.org/10.1007/s00453-018-0519-1","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:1604.05172","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1604.05172","pdf_url":"https://arxiv.org/pdf/1604.05172","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:sdu.dk:publications/47df171d-7ef3-482c-8ddc-facc544bfdce","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/47df171d-7ef3-482c-8ddc-facc544bfdce","pdf_url":"https://portal.findresearcher.sdu.dk/da/publications/47df171d-7ef3-482c-8ddc-facc544bfdce","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":"Boyar , J , Eidenbenz , S J , Favrholdt , L M , Kotrbcik , M & Larsen , K S 2016 , Online Dominating Set . in R Pagh (ed.) , 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016 . , 21 , Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik , Leibniz International Proceedings in Informatics , vol. 53 , pp. 1-15 , 15th Scandinavian Symposium and Workshops on Algorithm Theory , Reykjavik , Iceland , 22/06/2016 . https://doi.org/10.4230/LIPIcs.SWAT.2016.21","raw_type":"contributionToPeriodical"},{"id":"mag:2335836144","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1604.05172","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:espace.library.uq.edu.au:UQ:c22912f","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402388","display_name":"Queensland's institutional digital repository (The University of Queensland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165143802","host_organization_name":"The University of Queensland","host_organization_lineage":["https://openalex.org/I165143802"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"doi:10.48550/arxiv.1604.05172","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1604.05172","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.swat.2016.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2016.21","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:6043","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.21","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"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"}],"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"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W560340026","https://openalex.org/W564518845","https://openalex.org/W600072479","https://openalex.org/W1493071618","https://openalex.org/W1532428783","https://openalex.org/W1552828154","https://openalex.org/W1781979225","https://openalex.org/W1980780254","https://openalex.org/W1983156760","https://openalex.org/W1999667176","https://openalex.org/W2011670396","https://openalex.org/W2022841964","https://openalex.org/W2031490900","https://openalex.org/W2041645394","https://openalex.org/W2098502330","https://openalex.org/W2143996311","https://openalex.org/W2144599263","https://openalex.org/W2156760067","https://openalex.org/W2157054705","https://openalex.org/W2401610261","https://openalex.org/W3125435918","https://openalex.org/W4247549312"],"related_works":["https://openalex.org/W2893780080","https://openalex.org/W2809638413","https://openalex.org/W2020138610","https://openalex.org/W3122069597","https://openalex.org/W3146698804","https://openalex.org/W2543320042","https://openalex.org/W2963400632","https://openalex.org/W2565761069","https://openalex.org/W2169861334","https://openalex.org/W2767579966","https://openalex.org/W2964084225","https://openalex.org/W2905006802","https://openalex.org/W2607129247","https://openalex.org/W2581291501","https://openalex.org/W2463289310","https://openalex.org/W163148648","https://openalex.org/W2784498202","https://openalex.org/W3210036019","https://openalex.org/W3040496082","https://openalex.org/W2788123081"],"abstract_inverted_index":{"This":[0,53],"paper":[1,16],"is":[2,54],"devoted":[3],"to":[4,44,47,75,164],"the":[5,15,18,23,37,51,68,81,85,88,93,109,136,149,152,170],"online":[6,29,60,156,171],"dominating":[7],"set":[8],"problem":[9],"and":[10,39,103,117,132],"its":[11],"variants.":[12],"We":[13,78,95,128],"believe":[14],"represents":[17],"first":[19],"systematic":[20],"study":[21],"of":[22,25,28,50,59,84,87,113,138,151],"effect":[24],"two":[26,63,89],"limitations":[27],"algorithms:":[30],"making":[31],"irrevocable":[32],"decisions":[33],"while":[34],"not":[35,104],"knowing":[36,67],"future,":[38],"being":[40],"incremental,":[41],"i.e.,":[42],"having":[43,74,163],"maintain":[45],"solutions":[46],"all":[48,126],"prefixes":[49],"input.":[52],"quantified":[55],"through":[56],"competitive":[57,82],"analyses":[58],"algorithms":[61,91,157],"against":[62,92],"optimal":[64,90],"algorithms,":[65],"both":[66],"entire":[69],"input,":[70],"but":[71],"only":[72],"one":[73],"be":[76,158,165],"incremental.":[77,159],"also":[79,129],"consider":[80,96],"ratio":[83],"weaker":[86],"other.":[94],"important":[97],"graph":[98,111],"classes,":[99],"distinguishing":[100],"between":[101],"connected":[102,106],"necessarily":[105],"graphs.":[107,140],"For":[108],"classic":[110],"classes":[112],"trees,":[114],"bipartite,":[115],"planar,":[116],"general":[118],"graphs,":[119],"we":[120,144],"obtain":[121],"tight":[122],"results":[123],"in":[124],"almost":[125],"cases.":[127],"derive":[130],"upper":[131],"lower":[133],"bounds":[134],"for":[135,169],"class":[137],"bounded-degree":[139],"From":[141],"these":[142],"analyses,":[143],"get":[145],"detailed":[146],"information":[147],"regarding":[148],"significance":[150],"necessary":[153],"requirement":[154],"that":[155],"In":[160],"some":[161],"cases,":[162],"incremental":[166],"fully":[167],"accounts":[168],"algorithm\u2019s":[172],"disadvantage.":[173]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}