{"id":"https://openalex.org/W1973444128","doi":"https://doi.org/10.1145/1198513.1198522","title":"A general approach to online network optimization problems","display_name":"A general approach to online network optimization problems","publication_year":2006,"publication_date":"2006-10-01","ids":{"openalex":"https://openalex.org/W1973444128","doi":"https://doi.org/10.1145/1198513.1198522","mag":"1973444128"},"language":"en","primary_location":{"id":"doi:10.1145/1198513.1198522","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1198513.1198522","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noga Alon","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110260801","display_name":"Baruch Awerbuch","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baruch Awerbuch","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD","Johns Hopkins University, baltimore, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD","institution_ids":["https://openalex.org/I145311948"]},{"raw_affiliation_string":"Johns Hopkins University, baltimore, MD","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yossi Azar","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","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, Haifa, Israel","Technion , Haifa , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , 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, Haifa, Israel","Technion , Haifa , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.0342,"has_fulltext":false,"cited_by_count":116,"citation_normalized_percentile":{"value":0.97926172,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"2","issue":"4","first_page":"640","last_page":"660"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.710543155670166},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6860466003417969},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6788536310195923},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.5293099880218506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5225322246551514},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4854917824268341},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4703621566295624},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4560011923313141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.439731627702713},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43850386142730713},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4341433644294739},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.4227829575538635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39476272463798523},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3454795479774475},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.13264355063438416}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.710543155670166},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6860466003417969},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6788536310195923},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5293099880218506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5225322246551514},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4854917824268341},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4703621566295624},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4560011923313141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.439731627702713},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43850386142730713},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4341433644294739},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.4227829575538635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39476272463798523},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3454795479774475},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.13264355063438416},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1198513.1198522","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1198513.1198522","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.111.9395","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.9395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~nogaa/PDFS/steinerproc2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.639.5716","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.639.5716","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~azar/on_stein.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.80.348","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~azar/on_stein.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.7493","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.7493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.jhu.edu/~baruch/RESEARCH/Research_areas/Algorithmic_Theory/2004 SODA/soda04-conf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.5863","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.5863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~azar/on_stein.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1553785337","https://openalex.org/W1963964297","https://openalex.org/W1981114903","https://openalex.org/W1990313671","https://openalex.org/W2019062750","https://openalex.org/W2020066367","https://openalex.org/W2021185572","https://openalex.org/W2029437526","https://openalex.org/W2037408498","https://openalex.org/W2044343300","https://openalex.org/W2068871408","https://openalex.org/W2082353536","https://openalex.org/W2114493937","https://openalex.org/W2134422938","https://openalex.org/W2145818650","https://openalex.org/W2151242668","https://openalex.org/W2496163386","https://openalex.org/W2610052675","https://openalex.org/W2611804663","https://openalex.org/W3153460966","https://openalex.org/W4298157797","https://openalex.org/W4300550233","https://openalex.org/W6844382842"],"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/W1501526103"],"abstract_inverted_index":{"We":[0,79,135,253],"study":[1,19],"a":[2,27,35,66,82,92,219,311],"wide":[3],"range":[4],"of":[5,20,108,116,147,153,192,221,238,245,296,306],"online":[6,29,71,98,122,145,212,268,324],"graph":[7,300],"and":[8,22,77,126,132,159,178,187,217,240,274,301],"network":[9,30,37,61],"optimization":[10],"problems,":[11,125],"focusing":[12],"on":[13,165],"problems":[14,74],"that":[15,95],"arise":[16],"in":[17,24,42,48,59,110,272,288,298],"the":[18,40,51,60,97,106,111,148,154,172,197,211,222,225,229,236,243,267,286,294,299,304,323],"connectivity":[21,52,76,99],"cuts":[23],"graphs.":[25,134],"In":[26,228],"general":[28,83,289],"design":[31,310],"problem,":[32,233],"we":[33,309],"have":[34],"communication":[36],"known":[38,47],"to":[39,129,139],"algorithm":[41,89,209,265,284,321],"advance.":[43],"What":[44],"is":[45,105,127,156,235,242,250,293,303],"not":[46],"advance":[49],"are":[50],"(bandwidth)":[53],"or":[54,100],"cut":[55,101],"demands":[56],"between":[57],"vertices":[58,297],"which":[62],"arrive":[63],"online.We":[64],"develop":[65],"unified":[67],"framework":[68,155],"for":[69,73,90,119,169,184,196,210,218,266,285,322],"designing":[70],"algorithms":[72],"involving":[75],"cuts.":[78],"first":[80],"present":[81,255],"O":[84,202,257,276,313],"(log":[85,203,258,277,314],"m":[86,104,204,234],")-competitive":[87,207,263,282,320],"deterministic":[88,312],"generating":[91],"fractional":[93,121,149],"solution":[94],"satisfies":[96],"demands,":[102],"where":[103,291],"number":[107,237,244,295,305],"edges":[109],"graph.":[112],"This":[113,151],"may":[114],"be":[115],"independent":[117],"interest":[118],"solving":[120],"bandwidth":[123],"allocation":[124],"applicable":[128],"both":[130],"directed":[131],"undirected":[133],"then":[136],"show":[137],"how":[138],"obtain":[140],"integral":[141,198],"solutions":[142],"via":[143],"an":[144,201,256,275],"rounding":[146,182],"solution.":[150],"part":[152],"problem":[157,216,223,271,287],"dependent,":[158],"applies":[160],"various":[161],"tools":[162],"including":[163],"results":[164,195],"approximate":[166],"max-flow":[167],"min-cut":[168],"multicommodity":[170],"flow,":[171],"Hierarchically":[173],"Separated":[174],"Trees":[175],"(HST)":[176],"method":[177],"its":[179],"extensions,":[180],"certain":[181],"techniques":[183],"dependent":[185],"variables,":[186],"R\u00e4cke's":[188],"new":[189],"hierarchical":[190],"decomposition":[191],"graphs.Specifically,":[193],"our":[194],"case":[199],"include":[200],"log":[205,261,280,317,318],"n":[206,241,260,279,292,316,319],"randomized":[208,264,283],"nonmetric":[213,230],"facility":[214,231],"location":[215,232],"generalization":[220],"called":[224],"multicast":[226],"problem.":[227,326],"facilities":[239],"clients.":[246],"The":[247],"competitive":[248],"ratio":[249],"nearly":[251],"tight.":[252],"also":[254],"2":[259],"k":[262,281,302],"group":[269],"Steiner":[270],"trees":[273],"3":[278,315],"graphs,":[290],"groups.":[307],"Finally,":[308],"multi-cut":[325]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}