{"id":"https://openalex.org/W6910568813","doi":"https://doi.org/10.4230/lipics.icalp.2025.1","title":"Online Algorithm Design Beyond the Worst Case (Invited Talk)","display_name":"Online Algorithm Design Beyond the Worst Case (Invited Talk)","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6910568813","doi":"https://doi.org/10.4230/lipics.icalp.2025.1"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23378","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.1","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.1/LIPIcs.ICALP.2025.1.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"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.1/LIPIcs.ICALP.2025.1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gupta, Anupam","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gupta, Anupam","raw_affiliation_strings":["Computer Science Department, New York University, NY, USA"],"raw_orcid":"https://orcid.org/0000-0001-5579-3405","affiliations":[{"raw_affiliation_string":"Computer Science Department, New York University, NY, USA","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38473473,"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":true,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9025999903678894,"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.9025999903678894,"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.05660000070929527,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.012500000186264515,"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/online-algorithm","display_name":"Online algorithm","score":0.5365999937057495},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4745999872684479},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4722000062465668},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.3244999945163727},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.2816999852657318}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7391999959945679},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5365999937057495},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4745999872684479},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4722000062465668},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37059998512268066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35199999809265137},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3449000120162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32910001277923584},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3244999945163727},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2816999852657318},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2572999894618988}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23378","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.1","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.1/LIPIcs.ICALP.2025.1.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.icalp.2025.1","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.1","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:23378","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.1","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.1/LIPIcs.ICALP.2025.1.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"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5948264598846436}],"awards":[{"id":"https://openalex.org/G1068153873","display_name":null,"funder_award_id":"CCF-2006953","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1338653207","display_name":"Collaborative Research: AF: Small: Combinatorial Optimization for Stochastic Inputs","funder_award_id":"2006953","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7492581598","display_name":"AF: Small: Towards New Relaxations for Online Algorithms","funder_award_id":"2224718","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"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6910568813.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"analysis":[1],"of":[2,14,77,85,110,119,155],"algorithm":[3,68],"performance":[4],"in":[5,37,46,88,123,158],"the":[6,11,54,78,120,130,159],"worst-case":[7,125,160],"has":[8],"long":[9],"been":[10],"gold":[12],"standard":[13],"theoretical":[15],"computer":[16],"science:":[17],"it":[18],"provides":[19],"a":[20],"simple,":[21],"compelling,":[22],"and":[23,80,91,112],"robust":[24],"model,":[25],"which":[26],"can":[27,59,140],"often":[28],"be":[29,141],"predictive":[30],"as":[31,33,127,129],"well":[32,128],"descriptive.":[34],"That":[35],"said,":[36],"recent":[38],"years":[39],"we":[40,60,73,96],"have":[41],"seen":[42],"an":[43],"exciting":[44],"surge":[45],"analyzing":[47],"algorithms":[48],"using":[49],"models":[50],"that":[51,82,139],"go":[52],"beyond":[53,124],"worst":[55],"case.":[56],"Particularly,":[57],"how":[58],"use":[61],"ideas":[62,132],"from":[63],"machine":[64],"learning":[65],"to":[66,143],"inform":[67],"design?":[69],"In":[70],"this":[71,86],"talk":[72],"will":[74,97,116],"discuss":[75],"some":[76,118,134,136],"results":[79],"techniques":[81],"come":[83],"out":[84],"endeavor,":[87],"both":[89],"offline":[90],"online":[92],"settings.":[93,161],"For":[94],"example,":[95],"study":[98],"covering":[99],"problems":[100,106],"like":[101,107],"set":[102],"cover,":[103],"load":[104],"balancing":[105],"scheduling":[108],"jobs":[109],"machines,":[111],"cut":[113],"problems.":[114],"We":[115],"see":[117],"modeling":[121],"decisions":[122],"frameworks,":[126],"algorithmic":[131],"-":[133,138],"old,":[135],"new":[137],"used":[142],"give":[144],"more":[145],"nuanced":[146],"guarantees":[147],"for":[148],"these":[149,156],"classical":[150],"problems,":[151],"complementing":[152],"our":[153],"understanding":[154],"problem":[157]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}