{"id":"https://openalex.org/W4416952562","doi":"https://doi.org/10.4230/lipics.swat.2026.31","title":"Improved and Parameterized Algorithms for Online Multi-Level Aggregation","display_name":"Improved and Parameterized Algorithms for Online Multi-Level Aggregation","publication_year":2025,"publication_date":"2025-11-28","ids":{"openalex":"https://openalex.org/W4416952562","doi":"https://doi.org/10.4230/lipics.swat.2026.31"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2511.23211","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.23211","pdf_url":"https://arxiv.org/pdf/2511.23211","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.23211","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120681074","display_name":"Alexander Turoczy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Turoczy, Alexander","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019656174","display_name":"Young\u2010San Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Young-San","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37984528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9663000106811523,"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":0.9663000106811523,"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.0035000001080334187,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0031999999191612005,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7437000274658203},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.573199987411499},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5181999802589417},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4968999922275543},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4855000078678131},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.3950999975204468},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.39250001311302185},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.38679999113082886}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7437000274658203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6011000275611877},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.573199987411499},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5181999802589417},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4968999922275543},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4855000078678131},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4788999855518341},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3950999975204468},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.38679999113082886},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.36890000104904175},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35199999809265137},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.34290000796318054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33570000529289246},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3179999887943268},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3059000074863434},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2511.23211","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.23211","pdf_url":"https://arxiv.org/pdf/2511.23211","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26067","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.31","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.31/LIPIcs.SWAT.2026.31.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.48550/arxiv.2511.23211","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.23211","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.swat.2026.31","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.31","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"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":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2511.23211","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.23211","pdf_url":"https://arxiv.org/pdf/2511.23211","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,130],"study":[1],"the":[2,27,53,59,62,65,85,89,93,105,108,123,151,154,165,169,183,188,216,223,260,281,286],"online":[3,225,236],"multi-level":[4],"aggregation":[5,119],"problem":[6,287],"with":[7,275,290],"deadlines":[8],"(MLAP-D)":[9],"introduced":[10],"by":[11,80,240,251],"Bienkowski":[12],"et":[13],"al.":[14],"(ESA":[15],"2016,":[16],"OR":[17],"2020).":[18,256],"In":[19],"this":[20,221],"problem,":[21],"requests":[22,74,94],"arrive":[23],"over":[24],"time":[25],"at":[26],"vertices":[28,90,186],"of":[29,48,55,69,107,113,153,168,185,201,218],"a":[30,38,50,56,82,229],"given":[31,189],"vertex-weighted":[32],"tree,":[33],"and":[34,78,133,175,211,244,248,253,278],"each":[35,71],"request":[36,51,66,72],"has":[37],"deadline":[39],"that":[40,87,121,284],"it":[41],"must":[42],"be":[43,76,98],"served":[44,79],"by.":[45],"The":[46,101,111,191,234],"cost":[47,54,103,125],"serving":[49,70,127],"equals":[52],"path":[57],"from":[58,84,280],"root":[60,86],"to":[61,96,116,273,288],"vertex":[63],"where":[64,148,162,180],"resides.":[67],"Instead":[68],"individually,":[73],"can":[75],"aggregated":[77,102],"transmitting":[81],"subtree":[83],"spans":[88],"on":[91,228],"which":[92],"reside,":[95],"potentially":[97],"more":[99],"cost-effective.":[100],"is":[104,115,140,150,164,182,222],"weight":[106],"transmission":[109],"subtree.":[110],"goal":[112],"MLAP-D":[114],"find":[117],"an":[118,145,159],"solution":[120],"minimizes":[122],"total":[124],"while":[126],"all":[128],"requests.":[129],"present":[131,144,158],"improved":[132],"parameterized":[134,227],"algorithms":[135,237],"for":[136,196],"MLAP-D.":[137],"Our":[138,257,268],"result":[139],"twofold.":[141],"First,":[142],"we":[143,157],"$e(D+1)$-competitive":[146],"algorithm":[147,161,226],"$D$":[149],"depth":[152],"tree.":[155,170,190],"Second,":[156],"$e(4H+2)$-competitive":[160],"$H$":[163],"caterpillar":[166,192,208],"dimension":[167,193],"Here,":[171],"$H":[172,176,264],"\\le":[173,177],"D$":[174],"\\log_2":[178],"|V|$":[179],"$|V|$":[181],"number":[184],"in":[187],"remains":[194],"constant":[195],"rich":[197],"but":[198],"simple":[199,269],"classes":[200],"trees,":[202],"such":[203],"as":[204],"line":[205],"graphs":[206,209,213],"($H=1$),":[207],"($H=2$),":[210],"lobster":[212],"($H=3$).":[214],"To":[215],"best":[217],"our":[219],"knowledge,":[220],"first":[224],"measure":[230],"better":[231],"than":[232],"depth.":[233],"state-of-the-art":[235,261],"are":[238],"$6(D+1)$-competitive":[239],"Buchbinder,":[241],"Feldman,":[242],"Naor,":[243],"Talmon":[245],"(SODA":[246],"2017)":[247],"$O(\\log":[249],"|V|)$-competitive":[250],"Azar":[252],"Touitou":[254],"(FOCS":[255],"framework":[258,270],"outperforms":[259],"ratios":[262],"when":[263],"=":[265],"o(\\min\\{D,\\log_2":[266],"|V|\\})$.":[267],"directly":[271],"applies":[272],"trees":[274,289],"any":[276],"structure":[277],"differs":[279],"previous":[282],"frameworks":[283],"reduce":[285],"specific":[291],"structures.":[292]},"counts_by_year":[],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2025-12-03T00:00:00"}