{"id":"https://openalex.org/W4206478994","doi":"https://doi.org/10.1561/0400000024","title":"The Design of Competitive Online Algorithms via a Primal\u2014Dual Approach","display_name":"The Design of Competitive Online Algorithms via a Primal\u2014Dual Approach","publication_year":2009,"publication_date":"2009-05-15","ids":{"openalex":"https://openalex.org/W4206478994","doi":"https://doi.org/10.1561/0400000024"},"language":"en","primary_location":{"id":"doi:10.1561/0400000024","is_oa":false,"landing_page_url":"https://doi.org/10.1561/0400000024","pdf_url":null,"source":{"id":"https://openalex.org/S110848248","display_name":"Foundations and Trends\u00ae in Theoretical Computer Science","issn_l":"1551-305X","issn":["1551-305X","1551-3068"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318575","host_organization_name":"Now Publishers","host_organization_lineage":["https://openalex.org/P4310318575"],"host_organization_lineage_names":["Now Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Foundations and Trends\u00ae in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","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/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["Technion \u2014 Israel Institute of Technology Computer Science Department, ,","Computer Science Department, Technion \u2014 Israel Institute of Technology, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion \u2014 Israel Institute of Technology Computer Science Department, ,","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Science Department, Technion \u2014 Israel Institute of Technology, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Technion \u2014 Israel Institute of Technology Computer Science Department, ,","Computer Science Department, Technion \u2014 Israel Institute of Technology, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion \u2014 Israel Institute of Technology Computer Science Department, ,","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Science Department, Technion \u2014 Israel Institute of Technology, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":6.0559,"has_fulltext":false,"cited_by_count":217,"citation_normalized_percentile":{"value":0.96672093,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"3","issue":"2-3","first_page":"93","last_page":"263"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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.9977999925613403,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9495999813079834,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9423999786376953,"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/dual","display_name":"Dual (grammatical number)","score":0.6824619174003601},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5788678526878357},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49602898955345154},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4429543912410736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2866501212120056}],"concepts":[{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6824619174003601},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5788678526878357},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49602898955345154},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4429543912410736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2866501212120056},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1561/0400000024","is_oa":false,"landing_page_url":"https://doi.org/10.1561/0400000024","pdf_url":null,"source":{"id":"https://openalex.org/S110848248","display_name":"Foundations and Trends\u00ae in Theoretical Computer Science","issn_l":"1551-305X","issn":["1551-305X","1551-3068"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318575","host_organization_name":"Now Publishers","host_organization_lineage":["https://openalex.org/P4310318575"],"host_organization_lineage_names":["Now Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Foundations and Trends\u00ae in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G14379207","display_name":"Research towards Constructing Homomorphic Functional Encryption","funder_award_id":"22700020","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1518018875","https://openalex.org/W1923724101","https://openalex.org/W1973444128","https://openalex.org/W1984290406","https://openalex.org/W1992365371","https://openalex.org/W1993119087","https://openalex.org/W1996540180","https://openalex.org/W1998843748","https://openalex.org/W2001139415","https://openalex.org/W2003902046","https://openalex.org/W2021185572","https://openalex.org/W2021474514","https://openalex.org/W2025874591","https://openalex.org/W2029437526","https://openalex.org/W2040924621","https://openalex.org/W2041645394","https://openalex.org/W2051233655","https://openalex.org/W2054033098","https://openalex.org/W2060427246","https://openalex.org/W2064467943","https://openalex.org/W2064600658","https://openalex.org/W2069255833","https://openalex.org/W2081269878","https://openalex.org/W2083392624","https://openalex.org/W2089269509","https://openalex.org/W2089998595","https://openalex.org/W2109533535","https://openalex.org/W2114538202","https://openalex.org/W2117595194","https://openalex.org/W2123878303","https://openalex.org/W2131951207","https://openalex.org/W2134422938","https://openalex.org/W2143898135","https://openalex.org/W2143996311","https://openalex.org/W2148636365","https://openalex.org/W2156867662","https://openalex.org/W2157054705","https://openalex.org/W2157650361","https://openalex.org/W2163322487","https://openalex.org/W2165956524","https://openalex.org/W2610052675","https://openalex.org/W2952036964","https://openalex.org/W3011766368","https://openalex.org/W3137684744","https://openalex.org/W4243470929"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829"],"abstract_inverted_index":{"The":[0,30,160,183],"primal\u2014dual":[1,54,83,158,161],"method":[2,31,55,84,162],"is":[3,202,216,226],"a":[4,16,96,156,172,205],"powerful":[5],"algorithmic":[6],"technique":[7],"that":[8,106,136],"has":[9,32,56,163],"proved":[10],"to":[11,80,85,95,229],"be":[12,152,236],"extremely":[13],"useful":[14],"for":[15,27,42,175],"wide":[17,97],"variety":[18,98],"of":[19,24,38,50,69,88,99,130,180,191,198,210,222],"problems":[20,105,139],"in":[21,35,76,238],"the":[22,36,48,53,66,82,86,103,111,117,128,142,147,176,189,192,196,199,214,220,223],"area":[23,49],"approximation":[25,51],"algorithms":[26],"NP-hard":[28],"problems.":[29,101],"its":[33,93],"origins":[34],"realm":[37],"exact":[39],"algorithms,":[40,52,90],"e.g.,":[41],"matching":[43],"and":[44,71,91,127,146,178,195],"network":[45],"flow.":[46],"In":[47],"emerged":[57],"as":[58,141],"an":[59,230],"important":[60],"unifying":[61],"design":[62,177],"methodology,":[63],"starting":[64],"from":[65],"seminal":[67],"work":[68],"Goemans":[70],"Williamson":[72],"[60]":[73],"We":[74,133],"show":[75,92,135],"this":[77],"survey":[78],"how":[79],"extend":[81],"setting":[87],"online":[89,104,138,181,193,224],"applicability":[94],"fundamental":[100],"Among":[102],"we":[107],"consider":[108],"here":[109],"are":[110],"weighted":[112],"caching":[113],"problem,":[114,119,194],"generalized":[115],"caching,":[116],"set-cover":[118],"several":[120,164],"graph":[121],"optimization":[122],"problems,":[123],"routing,":[124],"load":[125],"balancing,":[126],"problem":[129,145,150],"allocating":[131],"ad-auctions.":[132],"also":[134],"classic":[137],"such":[140],"ski":[143],"rental":[144],"dynamic":[148],"TCP-acknowledgement":[149],"can":[151,235],"solved":[153],"optimally":[154],"using":[155],"simple":[157],"approach.":[159],"advantages":[165],"over":[166],"existing":[167],"methods.":[168],"First,":[169],"it":[170],"provides":[171],"general":[173],"recipe":[174],"analysis":[179,197,215],"algorithms.":[182],"linear":[184],"programming":[185],"formulation":[186],"helps":[187],"detecting":[188],"difficulties":[190],"competitive":[200],"ratio":[201],"direct,":[203],"without":[204],"potential":[206],"function":[207],"appearing":[208],"\"out":[209],"nowhere.\"":[211],"Finally,":[212],"since":[213],"done":[217],"via":[218],"duality,":[219],"competitiveness":[221],"algorithm":[225],"with":[227],"respect":[228],"optimal":[231],"fractional":[232],"solution,":[233],"which":[234],"advantageous":[237],"certain":[239],"scenarios.":[240]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":9}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}