{"id":"https://openalex.org/W2064147138","doi":null,"title":"Stochastic Analyses for Online Combinatorial Optimization Problems","display_name":"Stochastic Analyses for Online Combinatorial Optimization Problems","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2064147138","mag":"2064147138"},"language":"en","primary_location":{"id":"pmh:oai:repository.cmu.edu:compsci-1828","doi":null,"is_oa":false,"landing_page_url":"http://repository.cmu.edu/compsci/821","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W2064147138"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5045952512","display_name":"Naveen Garg","orcid":"https://orcid.org/0000-0001-7923-4464","observed_orcids":["https://orcid.org/0000-0001-7923-4464"]},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Naveen Garg","raw_affiliation_strings":["Indian Institute of Technology, New Delhi,India#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, New Delhi,India#TAB#","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405","observed_orcids":["https://orcid.org/0000-0001-5579-3405"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie-Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102836759","display_name":"Stefano Leonardi","orcid":"https://orcid.org/0000-0002-9809-7191","observed_orcids":["https://orcid.org/0000-0002-9809-7191"]},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Leonardi","raw_affiliation_strings":["University of Rome La Sapienza, Via Salaria, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rome La Sapienza, Via Salaria, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754","observed_orcids":["https://orcid.org/0000-0002-0907-3754"]},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["University of Rome La Sapienza, Via Salaria, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rome La Sapienza, Via Salaria, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5027,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.95982533,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0019000000320374966,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.00019999999494757503,"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/greedy-algorithm","display_name":"greedy algorithm","score":0.640999972820282},{"id":"https://openalex.org/keywords/logarithmic-lower-bound","display_name":"logarithmic lower bound","score":0.7799999713897705},{"id":"https://openalex.org/keywords/average-case-analysis","display_name":"average-case analysis","score":0.8299999833106995},{"id":"https://openalex.org/keywords/k-server-problem","display_name":"k-server problem","score":0.9559999704360962}],"concepts":[{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.7540484666824341},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7497231960296631},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6110146045684814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.579669713973999},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5523107647895813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5127283334732056},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5124462246894836},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47663745284080505},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4508969783782959},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4506424367427826},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.4378969669342041},{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.42275992035865784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39111021161079407},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34009748697280884},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3228740990161896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31476759910583496},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0966845154762268},{"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":"pmh:oai:repository.cmu.edu:compsci-1828","doi":null,"is_oa":false,"landing_page_url":"http://repository.cmu.edu/compsci/821","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1030.9095","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1030.9095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://repository.cmu.edu/cgi/viewcontent.cgi?article%3D1828%26context%3Dcompsci","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.119.2137","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.2137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.iitd.ernet.in/~naveen/mypapers/soda08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.7495","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.7495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~anupamg/papers/stoch-online.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.3632","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.3632","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.644.9343","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.644.9343","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W158123262","https://openalex.org/W204261080","https://openalex.org/W276536446","https://openalex.org/W1484951415","https://openalex.org/W1552828154","https://openalex.org/W1553785337","https://openalex.org/W1584243868","https://openalex.org/W1981673685","https://openalex.org/W1989990727","https://openalex.org/W1994220221","https://openalex.org/W1997761849","https://openalex.org/W2002285507","https://openalex.org/W2011670396","https://openalex.org/W2022179164","https://openalex.org/W2025845565","https://openalex.org/W2029437526","https://openalex.org/W2039298646","https://openalex.org/W2041645394","https://openalex.org/W2044156187","https://openalex.org/W2048720850","https://openalex.org/W2052294974","https://openalex.org/W2052993280","https://openalex.org/W2057974767","https://openalex.org/W2062382196","https://openalex.org/W2068714069","https://openalex.org/W2075354456","https://openalex.org/W2078850190","https://openalex.org/W2079936083","https://openalex.org/W2082099352","https://openalex.org/W2104701012","https://openalex.org/W2124295613","https://openalex.org/W2125295283","https://openalex.org/W2135071170","https://openalex.org/W2142779979","https://openalex.org/W2151242668","https://openalex.org/W2159472851","https://openalex.org/W2163724134","https://openalex.org/W2914415689","https://openalex.org/W3197565351"],"related_works":["https://openalex.org/W2398651089","https://openalex.org/W2271728747","https://openalex.org/W2783912369","https://openalex.org/W2037408498","https://openalex.org/W2288067613","https://openalex.org/W7097392126","https://openalex.org/W2113286397","https://openalex.org/W7096620931","https://openalex.org/W2020254384"],"abstract_inverted_index":{"In":[0],"this":[1,24,105],"paper,":[2],"we":[3,73,138,150,169],"study":[4],"online":[5,30,48,69],"algorithms":[6],"when":[7],"the":[8,43,56,65,68,96,118,133,156,162,179],"input":[9,119],"is":[10,37,59,80,130,147],"not":[11,38],"chosen":[12],"adversarially,":[13],"but":[14],"consists":[15,121],"of":[16,95,122,178],"draws":[17,124],"from":[18,64,84,125],"some":[19,85,111],"given":[20],"probability":[21,86],"distribution.":[22],"While":[23],"model":[25],"has":[26],"been":[27],"studied":[28],"for":[29,47],"problems":[31],"like":[32],"paging":[33],"and":[34,127],"k-server,":[35],"it":[36],"known":[39,131],"how":[40],"to":[41,110,132,161,173],"beat":[42],"\u0398(log":[44],"n)":[45],"bound":[46],"Steiner":[49,70,157],"tree":[50,71,158],"if":[51,76,144],"at":[52],"each":[53,77],"time":[54],"instant,":[55],"demand":[57,78],"vertex":[58,63,79],"a":[60,93],"uniformly":[61],"random":[62],"graph.":[66],"For":[67],"problem,":[72],"show":[74,139],"that":[75,117,128],"an":[81,175],"independent":[82,123],"draw":[83],"distribution":[87],"\u03c0:":[88],"V":[89],"\u2192":[90],"[0,":[91],"1],":[92],"variant":[94],"natural":[97],"greedy":[98],"algorithm":[99,134],"achieves":[100],"E\u03c9[A(\u03c9)]/E\u03c9[OPT(\u03c9)]":[101],"=":[102],"O(1);":[103],"moreover,":[104],"result":[106],"can":[107],"be":[108],"extended":[109],"other":[112],"subadditive":[113],"problems.":[114],"Both":[115],"assumptions":[116],"sequence":[120],"\u03c0,":[126],"\u03c0":[129],"are":[135],"both":[136],"essential;":[137],"(almost)":[140],"logarithmic":[141],"lower":[142],"bounds":[143],"either":[145],"assumption":[146],"violated.":[148],"Moreover,":[149],"give":[151,174],"preliminary":[152],"results":[153,159],"on":[154],"extending":[155],"above":[160],"related":[163],"\u201cexpected":[164],"ratio\u201d":[165],"measure":[166],"E\u03c9[A(\u03c9)/OPT(\u03c9)].":[167],"Finally,":[168],"use":[170],"these":[171],"ideas":[172],"average-case":[176],"analysis":[177],"Universal":[180],"TSP":[181],"problem.":[182],"1":[183]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2064147138","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
