{"id":"https://openalex.org/W4376639541","doi":"https://doi.org/10.1145/3564246.3585222","title":"Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse","display_name":"Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639541","doi":"https://doi.org/10.1145/3564246.3585222"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585222","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585222","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060555975","display_name":"Ravishankar Krishnaswamy","orcid":"https://orcid.org/0000-0002-5765-0843"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ravishankar Krishnaswamy","raw_affiliation_strings":["Microsoft Research, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100430766","display_name":"Shi Li","orcid":"https://orcid.org/0000-0001-9140-9415"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shi Li","raw_affiliation_strings":["University at Buffalo, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University at Buffalo, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073133738","display_name":"Varun Suriyanarayana","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Varun Suriyanarayana","raw_affiliation_strings":["Cornell University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"775","last_page":"788"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9987999796867371,"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/T11182","display_name":"Auction Theory and Applications","score":0.9922999739646912,"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/competitive-analysis","display_name":"Competitive analysis","score":0.7056766748428345},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6621155738830566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5784546732902527},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5481950044631958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4463573098182678},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4425064027309418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37603849172592163},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3489358425140381},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33381789922714233},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3232344686985016},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.26117026805877686},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1922398805618286},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06635081768035889}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7056766748428345},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6621155738830566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5784546732902527},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5481950044631958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4463573098182678},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4425064027309418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37603849172592163},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3489358425140381},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33381789922714233},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3232344686985016},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26117026805877686},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1922398805618286},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06635081768035889},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585222","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585222","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G3981631003","display_name":"CAREER: Approximate Scheduling Algorithms via Mathematical Relaxations","funder_award_id":"1844890","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5206232573","display_name":null,"funder_award_id":"CCF-1844890","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":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1552561242","https://openalex.org/W1966527086","https://openalex.org/W1993260581","https://openalex.org/W2021247612","https://openalex.org/W2064467943","https://openalex.org/W2095518199","https://openalex.org/W2102201348","https://openalex.org/W2156867662","https://openalex.org/W2161965494","https://openalex.org/W2912720049","https://openalex.org/W4220945553","https://openalex.org/W4236776215","https://openalex.org/W4247656554","https://openalex.org/W6903114607"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W2952391767"],"abstract_inverted_index":{"We":[0,24,62],"consider":[1],"the":[2,6,16,30,40,45,51,56,69,94,98],"recourse":[3,35,87],"version":[4],"of":[5,97],"classical":[7],"online":[8],"load":[9],"balancing":[10],"problem":[11,31,46,70],"on":[12],"unrelated":[13],"machines,":[14],"where":[15],"algorithm":[17,28,43,67],"is":[18,39],"allowed":[19],"to":[20,89],"re-assign":[21],"prior":[22,79],"jobs.":[23],"give":[25],"a":[26],"(2+\u0454)-competitive":[27],"for":[29,44,68,93],"with":[32,47,71,84],"O\u0454(logn)":[33],"amortized":[34,73,86],"per":[36],"job.":[37],"This":[38],"first":[41],"O(1)-competitive":[42],"non-trivial":[48],"recourse,":[49],"and":[50],"competitive":[52],"ratio":[53],"nearly":[54],"matches":[55],"long-standing":[57],"best-known":[58,76],"offline":[59],"approximation":[60],"guarantee.":[61],"also":[63],"show":[64],"an":[65],"O(loglogn/logloglogn)-competitive":[66],"O(1)":[72,85],"recourse.":[74],"The":[75],"bounds":[77],"from":[78],"work":[80],"are":[81],"O(loglogn)-competitive":[82],"algorithms":[83],"due":[88],"Gupta":[90],"et":[91],"al.,":[92],"special":[95],"case":[96],"restricted":[99],"assignment":[100],"model.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}