{"id":"https://openalex.org/W1985985425","doi":"https://doi.org/10.1137/11083976x","title":"A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions","display_name":"A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1985985425","doi":"https://doi.org/10.1137/11083976x","mag":"1985985425"},"language":"en","primary_location":{"id":"doi:10.1137/11083976x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11083976x","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/A5088287514","display_name":"Daniel \u0160tefankovi\u010d","orcid":"https://orcid.org/0000-0002-4849-7955"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel \u0160tefankovi\u010d","raw_affiliation_strings":["stefanko@cs.uchicago.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"stefanko@cs.uchicago.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101983359","display_name":"Santosh Vempala","orcid":"https://orcid.org/0000-0002-3779-433X"},"institutions":[{"id":"https://openalex.org/I4210147622","display_name":"Groupe d'Analyse et de Th\u00e9orie Economique Lyon St Etienne","ror":"https://ror.org/042fmc481","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I188626449","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210147622","https://openalex.org/I4405259976","https://openalex.org/I51195161"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Santosh Vempala","raw_affiliation_strings":["vempala@cc.gatech.edu and vigoda@cc.gatech.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"vempala@cc.gatech.edu and vigoda@cc.gatech.edu#TAB#","institution_ids":["https://openalex.org/I4210147622"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051363868","display_name":"Eric Vigoda","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eric Vigoda","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5685,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.94733369,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"41","issue":"2","first_page":"356","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9986000061035156,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8790819644927979},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7338780164718628},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7284643054008484},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6312851309776306},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5659789443016052},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5224127769470215},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5134943127632141},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5047999620437622},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5046249628067017},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5017790794372559},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4854033887386322},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4802042245864868},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.448661208152771},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4454437792301178},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25011545419692993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11055392026901245},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06234556436538696}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8790819644927979},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7338780164718628},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7284643054008484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6312851309776306},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5659789443016052},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5224127769470215},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5134943127632141},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5047999620437622},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5046249628067017},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5017790794372559},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4854033887386322},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4802042245864868},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.448661208152771},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4454437792301178},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25011545419692993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11055392026901245},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06234556436538696},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/11083976x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11083976x","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:CiteSeerX.psu:10.1.1.307.7738","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.7738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rochester.edu/~stefanko/Publications/SIAM12.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1527197079","https://openalex.org/W1607251184","https://openalex.org/W1991832118","https://openalex.org/W2003554015","https://openalex.org/W2004724832","https://openalex.org/W2005107874","https://openalex.org/W2007746582","https://openalex.org/W2024710200","https://openalex.org/W2035575256","https://openalex.org/W2063342497","https://openalex.org/W2088847343","https://openalex.org/W2097823813","https://openalex.org/W2106285343","https://openalex.org/W2109260999","https://openalex.org/W2114870555","https://openalex.org/W2135756775","https://openalex.org/W2147487384","https://openalex.org/W2150154671","https://openalex.org/W2152646636","https://openalex.org/W2156036190","https://openalex.org/W2159341052","https://openalex.org/W2161611531"],"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/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1984121220","https://openalex.org/W1556368910","https://openalex.org/W1601835603"],"abstract_inverted_index":{"Given":[0],"n":[1,61],"elements":[2],"with":[3],"nonnegative":[4],"integer":[5,12],"weights":[6,32],"$w_1,":[7],"\\ldots,":[8],"w_n$":[9],"and":[10,62,92,100,107],"an":[11],"capacity":[13],"C,":[14],"we":[15],"consider":[16],"the":[17,21,26,38,48],"counting":[18],"version":[19],"of":[20,28,50],"classic":[22],"knapsack":[23],"problem:":[24],"find":[25],"number":[27,49],"distinct":[29],"subsets":[30],"whose":[31],"add":[33],"up":[34],"to":[35,52],"at":[36],"most":[37],"given":[39],"capacity.":[40],"We":[41],"give":[42],"a":[43],"deterministic":[44],"algorithm":[45,71,76],"that":[46],"estimates":[47],"solutions":[51],"within":[53],"relative":[54],"error":[55],"$1\\pm\\varepsilon$":[56],"in":[57,60],"time":[58,73],"polynomial":[59,65],"$1/\\varepsilon$":[63],"(fully":[64],"approximation":[66,85],"scheme).":[67],"More":[68],"precisely,":[69],"our":[70],"takes":[72],"$O(n^3\\varepsilon^{-1}\\log(n/\\varepsilon))$.":[74],"Our":[75],"is":[77],"based":[78],"on":[79],"dynamic":[80,105],"programming.":[81],"Previously,":[82],"randomized":[83],"polynomial-time":[84],"schemes":[86],"were":[87],"known":[88],"first":[89],"by":[90,102],"Morris":[91],"Sinclair":[93],"via":[94,104],"Markov":[95],"chain":[96],"Monte":[97],"Carlo":[98],"techniques":[99],"subsequently":[101],"Dyer":[103],"programming":[106],"rejection":[108],"sampling.":[109]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}