{"id":"https://openalex.org/W2065021581","doi":"https://doi.org/10.1137/s0097539799361786","title":"The Accommodating Function: A Generalization of the Competitive Ratio","display_name":"The Accommodating Function: A Generalization of the Competitive Ratio","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2065021581","doi":"https://doi.org/10.1137/s0097539799361786","mag":"2065021581"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799361786","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799361786","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/A5068354624","display_name":"Joan Boyar","orcid":"https://orcid.org/0000-0002-0725-8341"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joan Boyar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000210653","display_name":"Kim S. Larsen","orcid":"https://orcid.org/0000-0003-0560-3794"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim S. Larsen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020552411","display_name":"Morten Nielsen","orcid":"https://orcid.org/0000-0002-8483-164X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morten N. Nielsen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068354624"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0264,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.9583045,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"1","first_page":"233","last_page":"258"},"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.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.9534410238265991},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.6281915903091431},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6276017427444458},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5804733037948608},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5284578204154968},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49359238147735596},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4881952404975891},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.4856082499027252},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.48337119817733765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4773155152797699},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4732031226158142},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46672502160072327},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.4520050883293152},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.41197142004966736},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3975343108177185},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2696980834007263},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12420979142189026}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9534410238265991},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6281915903091431},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6276017427444458},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5804733037948608},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5284578204154968},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49359238147735596},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4881952404975891},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.4856082499027252},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.48337119817733765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4773155152797699},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4732031226158142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46672502160072327},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.4520050883293152},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.41197142004966736},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3975343108177185},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2696980834007263},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12420979142189026},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s0097539799361786","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799361786","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"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/791bc810-41db-11dd-9fbe-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/791bc810-41db-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, Larsen, K S & Nielsen, M N 2001, 'The Accommodating Function : a generalization of the competitive ratio', SIAM Journal on Computing, vol. 31, no. 1, pp. 233-258. https://doi.org/10.1137/S0097539799361786","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.8757","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.8757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/Projects/ALCOMIT/Boyaretal98.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.9567","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.9567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.imada.sdu.dk/~joan/accomm.ps","raw_type":"text"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/6f206f40-4f1f-11dd-b1a1-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/6f206f40-4f1f-11dd-b1a1-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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Boyar , J , Larsen , K S & Nielsen , M N 1999 , The Accommodating Function : a generalization of the competitive ratio . in Algorithms and Data Structures, 6th International Workshop, WADS '99 . Springer , Lecture Notes in Computer Science , vol. 1663 , pp. 74-79 , Sixth International Workshop on Algorithms and Data Structures , Vancouver , Canada , 11/08/1999 . https://doi.org/10.1007/3-540-48447-7_9","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1980780254","https://openalex.org/W2011670396","https://openalex.org/W2012067948","https://openalex.org/W2041645394","https://openalex.org/W2042789015","https://openalex.org/W2043862089","https://openalex.org/W2047034252","https://openalex.org/W2068426617","https://openalex.org/W2073713788","https://openalex.org/W2075354456","https://openalex.org/W2089269509","https://openalex.org/W2159472851","https://openalex.org/W3136960240","https://openalex.org/W3197565351"],"related_works":["https://openalex.org/W2752015945","https://openalex.org/W2042512761","https://openalex.org/W3135987664","https://openalex.org/W2107065500","https://openalex.org/W1493790977","https://openalex.org/W4288363420","https://openalex.org/W2070091108","https://openalex.org/W1830700568","https://openalex.org/W2965585034","https://openalex.org/W3022071589"],"abstract_inverted_index":{"A":[0],"new":[1],"measure,":[2],"the":[3,7,23,27,34,44,70,76,96,110,133,138,146,151,173,186,190,198],"accommodating":[4,15,31,117,194,224],"function,":[5,16],"for":[6,50,119],"quality":[8,35],"of":[9,21,36,43,67,84,114,128,140,153,200],"on-line":[10,38,122],"algorithms":[11],"is":[12,18,75,135,160],"presented.":[13],"The":[14,116],"which":[17,132,177],"a":[19,41,103,126,208,218],"generalization":[20],"both":[22],"competitive":[24,28,187,191,211,221],"ratio":[25,29,78,188,192,212,222],"and":[26,150],"on":[30,80,193,223],"sequences,":[32],"measures":[33],"an":[37,51],"algorithm":[39,54,99],"as":[40,175],"function":[42,71],"resources":[45,68,85],"that":[46,88,165,205],"would":[47],"be":[48,183],"sufficient":[49],"optimal":[52,97],"off-line":[53,98],"to":[55,93,136,168,176],"fully":[56],"grant":[57],"all":[58],"requests.":[59],"More":[60],"precisely,":[61],"if":[62],"we":[63,203],"have":[64],"some":[65,81],"amount":[66,83,111],"n,":[69],"value":[72],"at":[73],"$\\alpha$":[74],"usual":[77],"(still":[79],"fixed":[82],"n),":[86],"except":[87],"input":[89],"sequences":[90,195,225],"are":[91,124],"restricted":[92],"those":[94],"where":[95],"will":[100],"not":[101],"obtain":[102],"better":[104,180,210,220],"result":[105],"by":[106],"having":[107],"more":[108],"than":[109,213,226],"$\\alpha":[112],"n$":[113],"resources.":[115],"functions":[118],"three":[120],"specific":[121],"problems":[123],"investigated:":[125],"variant":[127,199],"bin":[129],"packing":[130],"in":[131,143],"goal":[134],"maximize":[137],"number":[139],"items":[141],"put":[142],"n":[144],"bins,":[145],"seat":[147],"reservation":[148],"problem,":[149],"problem":[152],"optimizing":[154],"total":[155],"flow":[156],"time":[157],"when":[158,166],"preemption":[159],"allowed.":[161],"We":[162],"also":[163],"show":[164,204],"trying":[167],"distinguish":[169],"between":[170],"two":[171],"algorithms,":[172],"decision":[174],"one":[178],"performs":[179],"cannot":[181],"necessarily":[182],"made":[184],"from":[185],"or":[189],"alone.":[196],"For":[197],"bin-packing":[201],"considered,":[202],"Worst-Fit":[206],"has":[207,217],"strictly":[209,219],"First-Fit,":[214],"while":[215],"First-Fit":[216],"Worst-Fit.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}