{"id":"https://openalex.org/W7165735160","doi":"https://doi.org/10.4230/lipics.sand.2026.13","title":"Online Algorithms for Set Packing with Renewable Capacities","display_name":"Online Algorithms for Set Packing with Renewable Capacities","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165735160","doi":"https://doi.org/10.4230/lipics.sand.2026.13"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.sand.2026.13","is_oa":true,"landing_page_url":"https://dl.acm.org/doi/10.5555/3540261.3540470","pdf_url":"https://link.springer.com/content/pdf/bfm:978-3-319-42749-2/1","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://link.springer.com/content/pdf/bfm:978-3-319-42749-2/1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010089953","display_name":"Anya Chaturvedi","orcid":"https://orcid.org/0000-0002-4071-0467"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chaturvedi, Anya","raw_affiliation_strings":["School of Computing and Augmented Intelligence, Arizona State University, USA"],"raw_orcid":"https://orcid.org/0000-0002-4071-0467","affiliations":[{"raw_affiliation_string":"School of Computing and Augmented Intelligence, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070835473","display_name":"William K. Moses","orcid":"https://orcid.org/0000-0002-4533-7593"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Moses Jr., William K.","raw_affiliation_strings":["Department of Computer Science, Durham University, UK"],"raw_orcid":"https://orcid.org/0000-0002-4533-7593","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063355098","display_name":"Christian Scheideler","orcid":"https://orcid.org/0000-0002-5278-528X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Scheideler, Christian","raw_affiliation_strings":["Department of Computer Science, Paderborn University, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5278-528X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Paderborn University, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063692696","display_name":"Prudence W. H. Wong","orcid":"https://orcid.org/0000-0001-7935-7245"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Wong, Prudence W. H.","raw_affiliation_strings":["School of Computer Science and Informatics, University of Liverpool, UK"],"raw_orcid":"https://orcid.org/0000-0001-7935-7245","affiliations":[{"raw_affiliation_string":"School of Computer Science and Informatics, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"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.8072407,"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/T12176","display_name":"Optimization and Packing Problems","score":0.7544000148773193,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.7544000148773193,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.1444000005722046,"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.04800000041723251,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.6870999932289124},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6784999966621399},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6171000003814697},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6037999987602234},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5485000014305115},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5360999703407288},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.4011000096797943},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.3824999928474426}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6870999932289124},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6784999966621399},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6171000003814697},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6037999987602234},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5485000014305115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5475999712944031},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5360999703407288},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5333999991416931},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.4011000096797943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3962000012397766},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.3824999928474426},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3797000050544739},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.3303000032901764},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.32280001044273376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31850001215934753},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.2526000142097473}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.4230/lipics.sand.2026.13","is_oa":true,"landing_page_url":"https://dl.acm.org/doi/10.5555/3540261.3540470","pdf_url":"https://link.springer.com/content/pdf/bfm:978-3-319-42749-2/1","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26247","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.13","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.13/LIPIcs.SAND.2026.13.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":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.13","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.13","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.sand.2026.13","is_oa":true,"landing_page_url":"https://dl.acm.org/doi/10.5555/3540261.3540470","pdf_url":"https://link.springer.com/content/pdf/bfm:978-3-319-42749-2/1","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G152859138","display_name":null,"funder_award_id":"DESC0024386","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G2071775391","display_name":null,"funder_award_id":"DE-SC0024386","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3837698350","display_name":"CAREER: A Robust and Data-driven Design for Carbon-intelligent Distributed Systems","funder_award_id":"2045641","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6338401314","display_name":"2023 COMPUTATIONAL SCIENCE GRADUATE FELLOWSHIP PROGRAM","funder_award_id":"DESC0024386","funder_id":"https://openalex.org/F4320332359","funder_display_name":"Office of Science"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7648718735","display_name":"National Science Foundation Expeditions in Computing for Computational Decarbonization of Societal Infrastructures at Mesoscales","funder_award_id":"2325956","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7890882285","display_name":null,"funder_award_id":"DE-SC0024386","funder_id":"https://openalex.org/F4320337506","funder_display_name":"Advanced Scientific Computing Research"},{"id":"https://openalex.org/G8439905257","display_name":"Collaborative Research: CPS Medium: Enabling DER Integration via Redesign of Information Flows","funder_award_id":"2136199","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"},{"id":"https://openalex.org/F4320337506","display_name":"Advanced Scientific Computing Research","ror":"https://ror.org/0012c7r22"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165735160.pdf","grobid_xml":"https://content.openalex.org/works/W7165735160.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,139,170],"propose":[1],"and":[2,43,126,155,204,234],"study":[3],"a":[4,31,47,67,83,132,142,211],"new":[5],"extension":[6],"of":[7,33,69,71,87,97,101,167,199],"the":[8,16,26,102,107,164,168,179,200,214,221],"classical":[9],"set":[10],"packing":[11,19],"problem,":[12,134],"which":[13,93],"we":[14,219],"call":[15],"online":[17,121,187],"D-set":[18],"with":[20,35,66,73,189,238],"renewable":[21],"capacities":[22,110],"(D-SPaRC)":[23],"problem.":[24],"In":[25],"D-SPaRC":[27,133,222],"setting,":[28],"there":[29],"is":[30,64,147,163,194],"collection":[32,68],"resources":[34],"associated":[36,65],"capacities.":[37],"Requests":[38],"arrive":[39],"one":[40,86,95],"by":[41,229,235],"one,":[42],"for":[44,151,174],"each":[45,74,100],"request,":[46,84],"decision":[48],"has":[49],"to":[50,53,117,185,210],"be":[51,91,112,118,129,183,208],"made":[52],"accept":[54],"it":[55],"or":[56],"not":[57],"before":[58],"seeing":[59],"future":[60],"requests.":[61],"Each":[62],"request":[63,232],"subsets":[70,89],"resources,":[72],"subset":[75],"having":[76],"cardinality":[77],"at":[78],"most":[79],"D.":[80],"When":[81],"accepting":[82],"exactly":[85],"these":[88],"must":[90],"chosen,":[92],"consumes":[94],"unit":[96],"capacity":[98,166],"on":[99],"involved":[103],"resources.":[104,169],"Over":[105],"time,":[106],"available":[108],"resource":[109],"may":[111],"renewed,":[113],"allowing":[114],"additional":[115],"requests":[116,237],"accepted.":[119],"Many":[120],"problems,":[122],"including":[123],"packing,":[124],"routing,":[125],"scheduling,":[127],"can":[128,182],"formulated":[130],"as":[131],"thus":[135],"underlining":[136],"its":[137],"usefulness.":[138],"first":[140],"present":[141],"simple":[143],"greedy":[144,180,202],"algorithm":[145,181,188],"that":[146,198],"O(c\u0302_min":[148],"\u22c5":[149],"(D^{1/c\u0302_min}-1))-competitive":[150],"D":[152,158],"\u2265":[153],"2":[154],"3-competitive":[156],"if":[157],"=":[159,176],"1,":[160],"where":[161],"c\u0302_min":[162,175],"minimum":[165],"then":[171],"show":[172],"that,":[173],"\u03a9(log":[177],"D),":[178],"extended":[184],"an":[186],"predictions":[190,215],"whose":[191],"competitive":[192],"ratio":[193],"never":[195],"worse":[196],"than":[197],"original":[201],"approach":[203],"can,":[205],"in":[206,224],"fact,":[207],"reduced":[209],"constant":[212],"when":[213],"are":[216],"optimal.":[217],"Finally,":[218],"generalize":[220],"problem":[223],"two":[225],"meaningful":[226],"ways,":[227],"namely":[228],"addressing":[230],"non-uniform":[231,239],"priorities":[233],"handling":[236],"weights.":[240]},"counts_by_year":[],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2026-06-25T00:00:00"}