{"id":"https://openalex.org/W3108606623","doi":"https://doi.org/10.1007/s00453-021-00801-2","title":"Improved Online Algorithms for Knapsack and GAP in the Random Order Model","display_name":"Improved Online Algorithms for Knapsack and GAP in the Random Order Model","publication_year":2021,"publication_date":"2021-02-17","ids":{"openalex":"https://openalex.org/W3108606623","doi":"https://doi.org/10.1007/s00453-021-00801-2","mag":"3108606623","pmid":"https://pubmed.ncbi.nlm.nih.gov/34720295"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-021-00801-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-021-00801-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-021-00801-2.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-021-00801-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074909595","display_name":"Susanne Albers","orcid":"https://orcid.org/0000-0001-5848-5360"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Susanne Albers","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstr. 3, 85748 Garching, Germany","Technical University of Munich"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstr. 3, 85748 Garching, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085907661","display_name":"Arindam Khan","orcid":"https://orcid.org/0000-0001-7505-1687"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arindam Khan","raw_affiliation_strings":["Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 560012 India","Indian Institute of Science"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 560012 India","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Indian Institute of Science","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048700573","display_name":"Leon Ladewig","orcid":"https://orcid.org/0000-0001-5998-8154"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Leon Ladewig","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstr. 3, 85748 Garching, Germany","Technical University of Munich"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstr. 3, 85748 Garching, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074909595"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0144527,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"83","issue":"6","first_page":"1750","last_page":"1785"},"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.9718000292778015,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9610000252723694,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9700925350189209},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7260746359825134},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.6448552012443542},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6306107044219971},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6157638430595398},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5464594960212708},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5295810699462891},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4943199157714844},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4800642430782318},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4696938991546631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45742475986480713},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4364805817604065},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4325670599937439},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.41753146052360535},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.415536105632782},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41487616300582886},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3332711458206177},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.11599960923194885}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9700925350189209},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7260746359825134},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.6448552012443542},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6306107044219971},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6157638430595398},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5464594960212708},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5295810699462891},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4943199157714844},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4800642430782318},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4696938991546631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45742475986480713},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4364805817604065},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4325670599937439},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.41753146052360535},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.415536105632782},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41487616300582886},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3332711458206177},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.11599960923194885},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/s00453-021-00801-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-021-00801-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-021-00801-2.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmid:34720295","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/34720295","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":null},{"id":"pmh:oai:eprints.iisc.ac.in:68222","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401429","display_name":"ePrints@IISc (Indian Institute of Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:arXiv.org:2012.00497","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2012.00497","pdf_url":"https://arxiv.org/pdf/2012.00497","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:3108606623","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2012.00497.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:europepmc.org:7442810","is_oa":true,"landing_page_url":"http://europepmc.org/pmc/articles/PMC8550732","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1616857","is_oa":true,"landing_page_url":"https://mediatum.ub.tum.de/1616857","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:pubmedcentral.nih.gov:8550732","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/8550732","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"Text"},{"id":"doi:10.48550/arxiv.2012.00497","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2012.00497","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00453-021-00801-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-021-00801-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-021-00801-2.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3108606623.pdf","grobid_xml":"https://content.openalex.org/works/W3108606623.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W56687990","https://openalex.org/W122351777","https://openalex.org/W1578666690","https://openalex.org/W1589175915","https://openalex.org/W1659045240","https://openalex.org/W1770502437","https://openalex.org/W1783659154","https://openalex.org/W1970970009","https://openalex.org/W1978264569","https://openalex.org/W1980280644","https://openalex.org/W2000444555","https://openalex.org/W2011781744","https://openalex.org/W2013038332","https://openalex.org/W2029728897","https://openalex.org/W2042137350","https://openalex.org/W2043848465","https://openalex.org/W2061418963","https://openalex.org/W2065849714","https://openalex.org/W2066671865","https://openalex.org/W2066898525","https://openalex.org/W2079669094","https://openalex.org/W2086189137","https://openalex.org/W2093153678","https://openalex.org/W2104806240","https://openalex.org/W2117340018","https://openalex.org/W2119790020","https://openalex.org/W2122886291","https://openalex.org/W2131951207","https://openalex.org/W2148352389","https://openalex.org/W2151242668","https://openalex.org/W2155551092","https://openalex.org/W2164792208","https://openalex.org/W2211675820","https://openalex.org/W2240329227","https://openalex.org/W2543019080","https://openalex.org/W2559737349","https://openalex.org/W2577702044","https://openalex.org/W2782298540","https://openalex.org/W2797720335","https://openalex.org/W2808107677","https://openalex.org/W2809732835","https://openalex.org/W2899383020","https://openalex.org/W2953050595","https://openalex.org/W2962797157","https://openalex.org/W2964275525","https://openalex.org/W2990339327","https://openalex.org/W3032665695","https://openalex.org/W4236127247","https://openalex.org/W4237922950","https://openalex.org/W4240438018","https://openalex.org/W4247158798","https://openalex.org/W4247704339","https://openalex.org/W4252172911"],"related_works":["https://openalex.org/W2977419720","https://openalex.org/W2905904719","https://openalex.org/W2167807475","https://openalex.org/W2180461869","https://openalex.org/W2225844283","https://openalex.org/W1697684871","https://openalex.org/W3003251399","https://openalex.org/W2027345534","https://openalex.org/W1531019192","https://openalex.org/W2044668258","https://openalex.org/W2360061927","https://openalex.org/W3043295958","https://openalex.org/W1992753463","https://openalex.org/W2886153187","https://openalex.org/W1561097743","https://openalex.org/W116023966","https://openalex.org/W1714472976","https://openalex.org/W2551095121","https://openalex.org/W1544564822","https://openalex.org/W2789812716"],"abstract_inverted_index":{"The":[0,164],"<i>knapsack":[1],"problem</i>":[2,167],"is":[3,26,56,83,121],"one":[4,46,48],"of":[5,15,36,88,106,156,211],"the":[6,24,40,50,53,71,75,80,89,102,145,154,157,161,171,186,191,207],"classical":[7],"problems":[8,176],"in":[9,74,113,185,218],"combinatorial":[10],"optimization:":[11],"Given":[12],"a":[13,29,34,84,94,129,196],"set":[14],"items,":[16],"each":[17],"specified":[18],"by":[19,47],"its":[20],"size":[21],"and":[22,49,65,152,180],"profit,":[23],"goal":[25],"to":[27,160,178],"find":[28],"maximum":[30],"profit":[31],"packing":[32],"into":[33],"knapsack":[35,158,172],"bounded":[37],"capacity.":[38],"In":[39,148],"online":[41,72,188],"setting,":[42,189],"items":[43],"are":[44],"revealed":[45],"decision,":[51],"if":[52],"current":[54,103,208],"item":[55,90,141],"packed":[57],"or":[58],"discarded":[59],"forever,":[60],"must":[61],"be":[62],"done":[63],"immediately":[64],"irrevocably":[66],"upon":[67],"arrival.":[68],"We":[69,92,127,182],"study":[70,151],"variant":[73],"random":[76,86],"order":[77],"model":[78],"where":[79],"input":[81,146],"sequence":[82],"uniform":[85],"permutation":[87],"set.":[91],"develop":[93],"randomized":[95,198],"(1/6.65)-competitive":[96],"algorithm":[97,105,120,199,205],"for":[98,139,200],"this":[99],"problem,":[100,173],"outperforming":[101],"best":[104,209],"competitive":[107,212],"ratio":[108,213],"1/8.06":[109,214],"(Kesselheim":[110,215],"et":[111,216],"al.":[112,217],"SIAM":[114,219],"J":[115,220],"Comput":[116,221],"47(5):1939-1964,":[117,222],"2018).":[118,223],"Our":[119],"based":[122],"on":[123,144],"two":[124,135],"new":[125],"insights:":[126],"introduce":[128],"novel":[130],"algorithmic":[131],"approach":[132,194],"that":[133,184],"employs":[134],"given":[136],"algorithms,":[137],"optimized":[138],"restricted":[140],"classes,":[142],"sequentially":[143],"sequence.":[147],"addition,":[149],"we":[150],"exploit":[153],"relationship":[155],"problem":[159],"2-secretary":[162],"problem.":[163],"<i>generalized":[165],"assignment":[166],"(GAP)":[168],"includes,":[169],"besides":[170],"several":[174],"important":[175],"related":[177],"scheduling":[179],"matching.":[181],"show":[183],"same":[187],"applying":[190],"proposed":[192,204],"sequential":[193],"yields":[195],"(1/6.99)-competitive":[197],"GAP.":[201],"Again,":[202],"our":[203],"outperforms":[206],"result":[210]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}