{"id":"https://openalex.org/W2070091108","doi":"https://doi.org/10.1145/1240233.1240245","title":"The relative worst order ratio for online algorithms","display_name":"The relative worst order ratio for online algorithms","publication_year":2007,"publication_date":"2007-05-01","ids":{"openalex":"https://openalex.org/W2070091108","doi":"https://doi.org/10.1145/1240233.1240245","mag":"2070091108"},"language":"en","primary_location":{"id":"doi:10.1145/1240233.1240245","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1240233.1240245","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/A5068354624","display_name":"Joan Boyar","orcid":"https://orcid.org/0000-0002-0725-8341"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Joan Boyar","raw_affiliation_strings":["University of Southern Denmark, Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023065140","display_name":"Lene M. Favrholdt","orcid":"https://orcid.org/0000-0003-3054-2997"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lene M. Favrholdt","raw_affiliation_strings":["University of Southern Denmark, Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":null,"apc_paid":null,"fwci":8.9744,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.97909342,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"3","issue":"2","first_page":"22","last_page":"22"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8979029655456543},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.8747471570968628},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.7560958862304688},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7240146994590759},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.645541787147522},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5964499115943909},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5437804460525513},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5414490699768066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5298623442649841},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49503961205482483},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47830086946487427},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.47287601232528687},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46704477071762085},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4318958520889282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4231165051460266},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34937143325805664},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1466141939163208}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8979029655456543},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8747471570968628},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.7560958862304688},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7240146994590759},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.645541787147522},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5964499115943909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5437804460525513},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5414490699768066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5298623442649841},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49503961205482483},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47830086946487427},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.47287601232528687},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46704477071762085},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4318958520889282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4231165051460266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34937143325805664},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1466141939163208},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1240233.1240245","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1240233.1240245","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:sdu.dk:openaire_cris_publications/b43f5450-444e-11dd-9fbe-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/b43f5450-444e-11dd-9fbe-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Boyar, J & Favrholdt, L M 2007, 'The Relative Worst Order Ratio for On-Line Algorithms', ACM Transactions on Algorithms, vol. 3, no. 2. https://doi.org/10.1145/1240233.1240245","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1555216065","https://openalex.org/W1562729429","https://openalex.org/W1830700568","https://openalex.org/W1970376721","https://openalex.org/W1980780254","https://openalex.org/W2011670396","https://openalex.org/W2024579090","https://openalex.org/W2029728897","https://openalex.org/W2033855099","https://openalex.org/W2038178000","https://openalex.org/W2041645394","https://openalex.org/W2043862089","https://openalex.org/W2048628062","https://openalex.org/W2048905935","https://openalex.org/W2065021581","https://openalex.org/W2075354456","https://openalex.org/W2078659331","https://openalex.org/W2089269509","https://openalex.org/W2136789019","https://openalex.org/W2178699190","https://openalex.org/W2800613862","https://openalex.org/W6657951020"],"related_works":["https://openalex.org/W2042512761","https://openalex.org/W2107065500","https://openalex.org/W76601469","https://openalex.org/W4235035380","https://openalex.org/W2971368033","https://openalex.org/W4288363420","https://openalex.org/W2070091108","https://openalex.org/W1590563747","https://openalex.org/W1830700568","https://openalex.org/W3022071589"],"abstract_inverted_index":{"We":[0],"define":[1],"a":[2,58,107,122],"new":[3,36,119,156],"measure":[4],"for":[5,130],"the":[6,11,20,29,47,64,70,76,90,97,101,145,149],"quality":[7],"of":[8,49,57,63,99,103,110,126,135],"online":[9,42],"algorithms,":[10],"relative":[12],"worst":[13,55],"order":[14,31],"ratio":[15,22,32,37,48,147,151],",":[16],"using":[17,117],"ideas":[18],"from":[19,28],"max/max":[21],"[Ben-David":[23],"and":[24,27,89,121,158],"Borodin":[25],"1994]":[26],"random":[30],"[Kenyon":[33],"1996].":[34],"The":[35],"is":[38,78,96,128],"used":[39],"to":[40,79],"compare":[41],"algorithms":[43,114],"directly":[44],"by":[45],"taking":[46],"their":[50,53],"performances":[51],"on":[52,152],"respective":[54],"permutations":[56],"worst-case":[59],"sequence.":[60],"Two":[61],"variants":[62],"bin":[65,72,92,132],"packing":[66,73,93],"problem":[67,98],"are":[68,115,138,161],"considered:":[69],"classical":[71],"problem,":[74,94],"where":[75],"goal":[77],"fit":[80],"all":[81],"items":[82,104],"in":[83,106],"as":[84,87],"few":[85],"bins":[86],"possible,":[88],"dual":[91,131],"which":[95],"maximizing":[100],"number":[102,109],"packed":[105],"fixed":[108],"bins.":[111],"Several":[112],"known":[113],"compared":[116],"this":[118],"measure,":[120],"new,":[123],"simple":[124],"variant":[125],"first-fit":[127],"proposed":[129],"packing.":[133],"Many":[134],"our":[136],"results":[137],"consistent":[139],"with":[140,144],"those":[141],"previously":[142],"obtained":[143],"competitive":[146,150],"or":[148],"accommodating":[153],"sequences,":[154],"but":[155],"separations":[157],"easier":[159],"proofs":[160],"found.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}