{"id":"https://openalex.org/W4399520697","doi":"https://doi.org/10.1145/3618260.3649677","title":"(1 \u2212 <i>\ud835\udf00</i> )-Approximation of Knapsack in Nearly Quadratic Time","display_name":"(1 \u2212 <i>\ud835\udf00</i> )-Approximation of Knapsack in Nearly Quadratic Time","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399520697","doi":"https://doi.org/10.1145/3618260.3649677"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649677","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649677","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649677","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649677","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063818718","display_name":"Xiao Mao","orcid":"https://orcid.org/0000-0002-1224-9730"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiao Mao","raw_affiliation_strings":["Stanford University, Stanford, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063818718"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10603448,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"295","last_page":"306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965000152587891,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/knapsack-problem","display_name":"Knapsack problem","score":0.9240478873252869},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7853854298591614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6563737392425537},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6257173418998718},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6205275058746338},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6017880439758301},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5912450551986694},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5858905911445618},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5404679775238037},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5385364890098572},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5202832818031311},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5077468156814575},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4978921413421631},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49633175134658813},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.43560469150543213},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4309428036212921},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4307023882865906},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2729380130767822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1779380738735199},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08259263634681702},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05864110589027405}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9240478873252869},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7853854298591614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6563737392425537},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6257173418998718},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6205275058746338},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6017880439758301},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5912450551986694},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5858905911445618},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5404679775238037},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5385364890098572},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5202832818031311},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5077468156814575},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4978921413421631},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49633175134658813},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.43560469150543213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4309428036212921},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4307023882865906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2729380130767822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1779380738735199},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08259263634681702},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05864110589027405},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649677","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649677","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649677","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649677","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649677","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649677","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399520697.pdf","grobid_xml":"https://content.openalex.org/works/W4399520697.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W129922982","https://openalex.org/W1866060861","https://openalex.org/W2026891055","https://openalex.org/W2055257826","https://openalex.org/W2064790310","https://openalex.org/W2076845371","https://openalex.org/W2081136687","https://openalex.org/W2113195911","https://openalex.org/W2174643652","https://openalex.org/W2592514830","https://openalex.org/W2593213569","https://openalex.org/W2751193914","https://openalex.org/W2783992526","https://openalex.org/W2795466116","https://openalex.org/W2936175778","https://openalex.org/W2951283560","https://openalex.org/W3115372711","https://openalex.org/W3125825223","https://openalex.org/W4242600797","https://openalex.org/W4255529553","https://openalex.org/W4316652435","https://openalex.org/W6948126280"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3166857172","https://openalex.org/W3169691842","https://openalex.org/W1701984136","https://openalex.org/W2565865680","https://openalex.org/W1508924483","https://openalex.org/W4399520697","https://openalex.org/W2053924317","https://openalex.org/W2683098551"],"abstract_inverted_index":{"Knapsack":[0],"is":[1,20,57],"one":[2],"of":[3,25],"the":[4,13,36,54,88,99,134,157],"most":[5],"fundamental":[6],"problems":[7],"in":[8,61,114,128,145],"theoretical":[9],"computer":[10],"science.":[11],"In":[12],"(1":[14,106,117],"\u2212":[15,32,107],"\u0454)-approximation":[16,108],"setting,":[17],"although":[18],"there":[19],"a":[21,83,93,104,125,129,151],"fine-grained":[22],"lower":[23,89],"bound":[24,90],"(n":[26],"+":[27,63,116],"1":[28],"/":[29,118],"\u0454)":[30,119],"2":[31],"o(1)":[33],"based":[34],"on":[35],"(min,":[37],"+)-convolution":[38],"hypothesis":[39],"([K'unnemann,":[40],"Paturi":[41],"and":[42,47,51,59,68,72],"Stefan":[43],"Schneider,":[44],"ICALP":[45],"2017]":[46],"[Cygan,":[48],"Mucha,":[49],"Wegrzycki":[50],"Wlodarczyk,":[52],"2017]),":[53],"best":[55],"algorithm":[56,81,155],"randomized":[58],"runs":[60,113],"\u00d5(n":[62,115],"(1/\u0454)11/5/2\u03a9(\u221alog(1/\u0454)))":[64],"time":[65,85],"[Deng,":[66],"Jin":[67],"Mao,":[69],"SODA":[70],"2023],":[71],"it":[73],"remains":[74],"an":[75,80],"important":[76],"open":[77],"problem":[78,135],"whether":[79],"with":[82,143],"running":[84],"that":[86,112],"matches":[87],"(up":[91],"to":[92,132,136],"sub-polynomial":[94],"factor)":[95],"exists.":[96],"We":[97,122],"answer":[98],"question":[100],"positively":[101],"by":[102],"showing":[103],"deterministic":[105],"scheme":[109],"for":[110,140,156],"knapsack":[111],"2)":[120],"time.":[121],"first":[123],"extend":[124],"known":[126],"lemma":[127],"recursive":[130],"way":[131],"reduce":[133],"n":[137,141],"\u0454-additive":[138],"approximation":[139],"items":[142],"profits":[144],"[1,":[146],"2).":[147],"Then":[148],"we":[149],"give":[150],"simple":[152],"efficient":[153],"geometry-based":[154],"reduced":[158],"problem.":[159]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}