{"id":"https://openalex.org/W2072577896","doi":"https://doi.org/10.1145/1383369.1383379","title":"The relative worst order ratio applied to seat reservation","display_name":"The relative worst order ratio applied to seat reservation","publication_year":2008,"publication_date":"2008-08-01","ids":{"openalex":"https://openalex.org/W2072577896","doi":"https://doi.org/10.1145/1383369.1383379","mag":"2072577896"},"language":"en","primary_location":{"id":"doi:10.1145/1383369.1383379","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1383369.1383379","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/A5066909672","display_name":"Paul Medvedev","orcid":"https://orcid.org/0000-0003-3143-594X"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Paul Medvedev","raw_affiliation_strings":["University of Toronto, Toronto, Ontario, Canada","* University of Toronto, Toronto, Ontario, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"* University of Toronto, Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2769,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.95686602,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":"4","first_page":"1","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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12546","display_name":"Smart Parking Systems Research","score":0.9847999811172485,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/reservation","display_name":"Reservation","score":0.7906452417373657},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.6700659990310669},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6636872291564941},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5962013006210327},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.577807605266571},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.44521787762641907},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4388103187084198},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4181288182735443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41423526406288147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35202884674072266},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.31433969736099243},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.20927944779396057},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10873782634735107}],"concepts":[{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.7906452417373657},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.6700659990310669},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6636872291564941},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5962013006210327},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.577807605266571},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.44521787762641907},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4388103187084198},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4181288182735443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41423526406288147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35202884674072266},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31433969736099243},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.20927944779396057},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10873782634735107},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1383369.1383379","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1383369.1383379","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/c64f8570-6f50-11dd-b1a1-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/c64f8570-6f50-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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Boyar, J & Medvedev, P 2008, 'The Relative Worst Order Ratio Applied to Seat Reservation', ACM Transactions on Algorithms, vol. 4, no. 4. https://doi.org/10.1145/1383369.1383379","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W203573418","https://openalex.org/W345637930","https://openalex.org/W1500640224","https://openalex.org/W1562729429","https://openalex.org/W1729082581","https://openalex.org/W1970376721","https://openalex.org/W1980780254","https://openalex.org/W1989350156","https://openalex.org/W1997595976","https://openalex.org/W2008126942","https://openalex.org/W2010422538","https://openalex.org/W2011670396","https://openalex.org/W2012729006","https://openalex.org/W2029728897","https://openalex.org/W2033855099","https://openalex.org/W2041645394","https://openalex.org/W2048905935","https://openalex.org/W2062221600","https://openalex.org/W2065021581","https://openalex.org/W2070091108","https://openalex.org/W2075354456","https://openalex.org/W2080354718","https://openalex.org/W2081414879","https://openalex.org/W2089269509","https://openalex.org/W2156707433"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W4390751688"],"abstract_inverted_index":{"The":[0,26],"seat":[1],"reservation":[2],"problem":[3,6,32,73],"is":[4,33],"the":[5,36,46,72,76],"of":[7,28,48,71],"assigning":[8],"passengers":[9],"to":[10,86],"seats":[11,17],"on":[12],"a":[13,41],"train":[14],"with":[15],"n":[16],"and":[18,82],"k":[19],"stations":[20],"enroute":[21],"in":[22],"an":[23],"online":[24,49],"manner.":[25],"performance":[27],"algorithms":[29],"for":[30,45,53,68],"this":[31],"studied":[34],"using":[35,75],"relative":[37,77],"worst":[38,78],"order":[39,79],"ratio,":[40,80],"fairly":[42],"new":[43,62],"measure":[44],"quality":[47],"algorithms,":[50],"which":[51],"allows":[52],"direct":[54],"comparisons":[55],"between":[56,64],"algorithms.":[57,65],"This":[58],"study":[59],"has":[60],"yielded":[61],"separations":[63],"For":[66],"example,":[67],"both":[69],"variants":[70],"considered,":[74],"First-Fit":[81],"Best-Fit":[83],"are":[84],"shown":[85],"be":[87],"better":[88],"than":[89],"Worst-Fit.":[90]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}