{"id":"https://openalex.org/W2205536044","doi":"https://doi.org/10.4086/toc.2010.v006a002","title":"","display_name":"","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2205536044","doi":"https://doi.org/10.4086/toc.2010.v006a002","mag":"2205536044"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2010.v006a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a002","pdf_url":"https://theoryofcomputing.org/articles/v006a002/v006a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v006a002/v006a002.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007064425","display_name":"Matthias Englert","orcid":"https://orcid.org/0000-0002-8859-7731"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthias Englert","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058889013","display_name":"Harald Raecke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harald Raecke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5079496968","display_name":"Matthias Westermann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthias Westermann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4623,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.84598081,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":"1","first_page":"27","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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.9988999962806702,"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.9980999827384949,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9882000088691711,"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.7488277554512024},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.7210896015167236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6423237919807434},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5681726932525635},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4911646544933319},{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.4746154844760895},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.44845905900001526},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.44212955236434937},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4388941526412964},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4185448884963989},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38360321521759033},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35519370436668396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3367047607898712},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31604862213134766},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30878493189811707},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2678098678588867},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.1304006576538086}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7488277554512024},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.7210896015167236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6423237919807434},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5681726932525635},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4911646544933319},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.4746154844760895},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44845905900001526},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.44212955236434937},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4388941526412964},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4185448884963989},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38360321521759033},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35519370436668396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3367047607898712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31604862213134766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30878493189811707},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2678098678588867},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.1304006576538086},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2010.v006a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a002","pdf_url":"https://theoryofcomputing.org/articles/v006a002/v006a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2010.v006a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a002","pdf_url":"https://theoryofcomputing.org/articles/v006a002/v006a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4000000059604645}],"awards":[{"id":"https://openalex.org/G3181115721","display_name":"Randomisation in Online Algorithms, Load Balancing and other Dynamic Problems","funder_award_id":"EP/F043333/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7326268580","display_name":null,"funder_award_id":"WE 2842/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2205536044.pdf","grobid_xml":"https://content.openalex.org/works/W2205536044.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1513609231","https://openalex.org/W1560295878","https://openalex.org/W1867520515","https://openalex.org/W1945035348","https://openalex.org/W1996218716","https://openalex.org/W2041571997","https://openalex.org/W2042812166","https://openalex.org/W2100800648","https://openalex.org/W2114493937","https://openalex.org/W2120305839","https://openalex.org/W2142215646","https://openalex.org/W2163017071","https://openalex.org/W2175911786","https://openalex.org/W2504554295","https://openalex.org/W2940595899","https://openalex.org/W3030774092","https://openalex.org/W4210634114","https://openalex.org/W4242631410","https://openalex.org/W4247271907","https://openalex.org/W4251923599"],"related_works":["https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2058681277","https://openalex.org/W2781235162","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2772037640","https://openalex.org/W2951573806","https://openalex.org/W2088826026","https://openalex.org/W96431103"],"abstract_inverted_index":{"In":[0],"the":[1,30,35,42,47,50,57,73],"reordering":[2,62],"buffer":[3,63],"problem,":[4],"we":[5],"are":[6],"given":[7],"an":[8,84],"input":[9,74],"sequence":[10,75,86],"of":[11,16,28],"requests":[12,31],"for":[13,98],"service":[14,89],"each":[15],"which":[17],"corresponds":[18],"to":[19,46,71,82],"a":[20,23,40,77],"point":[21],"in":[22,49,76,101,111,117],"metric":[24,51],"space.":[25],"The":[26],"cost":[27,43],"serving":[29,39],"heavily":[32],"depends":[33],"on":[34],"processing":[36],"order.":[37],"When":[38],"request":[41,55],"is":[44,96],"equal":[45],"distance,":[48],"space,":[52],"between":[53],"this":[54],"and":[56,93,104],"previously":[58],"served":[59],"request.":[60],"A":[61],"with":[64,87],"storage":[65],"capacity":[66],"k":[67],"can":[68],"be":[69],"used":[70],"reorder":[72],"restricted":[78],"fashion":[79],"so":[80],"as":[81],"construct":[83],"output":[85],"lower":[88],"cost.":[90],"This":[91],"simple":[92],"universal":[94],"framework":[95],"useful":[97],"many":[99],"applications":[100],"computer":[102,112],"science":[103],"economics,":[105],"e.":[106],"g.,":[107],"disk":[108],"scheduling,":[109],"rendering":[110],"graphics,":[113],"or":[114],"painting":[115],"shops":[116],"car":[118],"plants.":[119]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2016-06-24T00:00:00"}