{"id":"https://openalex.org/W2899383020","doi":"https://doi.org/10.1137/15m1033708","title":"Primal Beats Dual on Online Packing LPs in the Random-Order Model","display_name":"Primal Beats Dual on Online Packing LPs in the Random-Order Model","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2899383020","doi":"https://doi.org/10.1137/15m1033708","mag":"2899383020"},"language":"en","primary_location":{"id":"doi:10.1137/15m1033708","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1033708","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5011165333","display_name":"Thomas Ke\u00dfelheim","orcid":"https://orcid.org/0000-0002-9420-9424"},"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":"Thomas Kesselheim","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034764836","display_name":"Klaus Radke","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Radke","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110539686","display_name":"Andreas T\u00f6nnis","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas T\u00f6nnis","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066021048","display_name":"Berthold V\u00f6cking","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Berthold V\u00f6cking","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7168,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.86416529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"47","issue":"5","first_page":"1939","last_page":"1964"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.992900013923645,"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.9927999973297119,"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.758129894733429},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6963716745376587},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.617506742477417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5952889919281006},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.592983603477478},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5775772333145142},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.560822606086731},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5014135837554932},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.45289674401283264},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4171898663043976},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.4171678423881531},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4134267568588257},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.37207821011543274},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3610144853591919},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2945275604724884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2733754515647888}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.758129894733429},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6963716745376587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.617506742477417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5952889919281006},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.592983603477478},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5775772333145142},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.560822606086731},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5014135837554932},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.45289674401283264},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4171898663043976},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.4171678423881531},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4134267568588257},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37207821011543274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3610144853591919},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2945275604724884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2733754515647888},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1033708","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1033708","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2878325143","display_name":null,"funder_award_id":"GRK/1298","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3925850173","display_name":null,"funder_award_id":"VO 889/4-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322572","display_name":"Studienstiftung des Deutschen Volkes","ror":"https://ror.org/05xwwfy96"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W782508147","https://openalex.org/W1965765215","https://openalex.org/W2062075466","https://openalex.org/W2065849714","https://openalex.org/W2122886291","https://openalex.org/W2131951207","https://openalex.org/W2148352389","https://openalex.org/W2621304102","https://openalex.org/W2797720335"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2019137296","https://openalex.org/W2567853751"],"abstract_inverted_index":{"We":[0,198],"study":[1],"packing":[2,148,209,270],"linear":[3],"programs":[4],"(LPs)":[5],"in":[6,18,26,75],"an":[7,192,238,265],"online":[8,33,59,127,298],"model":[9],"where":[10,39,275],"the":[11,16,64,68,82,87,90,96,110,121,139,160,167,178,186,226,242,278,288,296],"columns":[12,45],"are":[13],"presented":[14],"to":[15,42,46,119,138,144,158,190,208,287],"algorithm":[17,152,168,299],"random":[19],"order.":[20],"This":[21],"natural":[22],"problem":[23,291],"was":[24],"investigated":[25],"various":[27],"recent":[28],"studies":[29],"motivated,":[30],"e.g.,":[31],"by":[32,231],"ad":[34],"allocations":[35],"and":[36,44,79,95,183,263],"yield":[37],"management,":[38],"rows":[40],"correspond":[41],"resources":[43,72,163],"requests":[47],"specifying":[48],"demands":[49],"for":[50,99,124,171,195,247,269,292],"resources.":[51],"Our":[52,129],"main":[53],"contribution":[54],"is":[55,117,205,229,277],"a":[56,76,93,107,174,232],"$1-O(\\sqrt{\\nicefrac{(\\log":[57],"d)}{B}})$-competitive":[58],"algorithm.":[60],"Here":[61],"$d$":[62],"denotes":[63,81],"column":[65],"sparsity,":[66],"i.e.,":[67,86],"maximum":[69,97],"number":[70,279],"of":[71,92,162,177,215,245,280],"that":[73,200,254],"occur":[74],"single":[77],"column,":[78],"$B$":[80],"capacity":[83,91,111,140,213,227],"ratio":[84,88,112,214,228,244,302],"$B$,":[85],"between":[89],"resource":[94],"demand":[98],"this":[100,196,201],"resource.":[101],"In":[102,142,234,250],"other":[103],"words,":[104],"we":[105,236,252,283,294],"achieve":[106],"$(1-\\epsilon)$-approximation":[108],"if":[109,225],"satisfies":[113],"$B=\\Omega(\\frac{\\log":[114,273],"d}{\\epsilon^2})$,":[115],"which":[116,293],"known":[118,180],"be":[120,258],"best":[122],"possible":[123],"any":[125,248],"(randomized)":[126],"algorithms.":[128],"result":[130],"improves":[131],"exponentially":[132],"on":[133,147,241],"previous":[134],"work":[135],"with":[136,211,260,272,300],"respect":[137],"ratio.":[141],"contrast":[143],"existing":[145],"results":[146],"LP":[149],"problems,":[150],"our":[151,255,285],"does":[153],"not":[154,206],"use":[155],"dual":[156],"prices":[157],"guide":[159],"allocation":[161,194],"over":[164],"time.":[165],"Instead,":[166],"simply":[169],"solves,":[170],"each":[172],"request,":[173],"scaled":[175],"version":[176],"partially":[179],"primal":[181],"program":[182],"randomly":[184],"rounds":[185],"obtained":[187],"fractional":[188],"solution":[189],"obtain":[191,264,295],"integral":[193],"request.":[197],"show":[199,253],"simple":[202],"algorithmic":[203],"technique":[204,286],"restricted":[207],"LPs":[210,271],"large":[212],"order":[216],"$\\Omega(\\log":[217],"d)$,":[218],"but":[219],"also":[220],"yields":[221],"close-to-optimal":[222],"competitive":[223,243,301],"ratios":[224],"bounded":[230],"constant.":[233],"particular,":[235],"prove":[237],"upper":[239],"bound":[240],"$\\Omega(d^{\\nicefrac{-1}{(B-1)}})$":[246],"$B\\geq2$.":[249],"addition,":[251],"approach":[256],"can":[257],"combined":[259],"VCG":[261],"payments":[262],"incentive-compatible":[266],"$(1-\\epsilon)$-competitive":[267],"mechanism":[268],"m}{\\epsilon^2})$,":[274],"$m$":[276],"constraints.":[281],"Finally,":[282],"apply":[284],"generalized":[289],"assignment":[290],"first":[297],"$O(1)$.":[303]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}