{"id":"https://openalex.org/W2013198217","doi":"https://doi.org/10.5555/338219.338254","title":"A PTAS for the multiple knapsack problem","display_name":"A PTAS for the multiple knapsack problem","alternate_titles":[],"publication_year":2000,"publication_date":"2000-02-01","ids":{"openalex":"https://openalex.org/W2013198217","doi":"https://doi.org/10.5555/338219.338254","mag":"2013198217"},"language":"en","primary_location":{"id":"pmh:oai:repository.upenn.edu:20.500.14332/6174","doi":null,"is_oa":false,"landing_page_url":"https://repository.upenn.edu/handle/20.500.14332/6174","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"},"parent_works":[],"lineage":["https://openalex.org/W2013198217"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://repository.upenn.edu/cis_papers/146","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699","observed_orcids":["https://orcid.org/0000-0003-3035-1699"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["BEll-Labs, 600 Mountain Ave, Murray Hill, NJ"],"raw_orcid":"https://orcid.org/0000-0003-3035-1699","affiliations":[{"raw_affiliation_string":"BEll-Labs, 600 Mountain Ave, Murray Hill, NJ","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689","observed_orcids":["https://orcid.org/0009-0000-2601-1689"]},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA and Bell Labs, Murray Hill"],"raw_orcid":"https://orcid.org/0009-0000-2601-1689","affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA and Bell Labs, Murray Hill","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":34.9591,"has_fulltext":true,"cited_by_count":306,"citation_normalized_percentile":{"value":0.99845161,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"213","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9961000084877014,"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.9961000084877014,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.002899999963119626,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":9.999999747378752e-05,"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/multiple-knapsack-problem","display_name":"multiple knapsack problem","score":0.9980000257492065},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"polynomial-time approximation scheme","score":0.8939999938011169},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"generalized assignment problem","score":0.9850000143051147},{"id":"https://openalex.org/keywords/apx-hardness","display_name":"APX-hardness","score":0.8450000286102295},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"bin packing","score":0.7020000219345093},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"knapsack problem","score":0.8960000276565552},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6230000257492065}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9505351781845093},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8082231879234314},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7043718695640564},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.5830329656600952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5808482766151428},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5652767419815063},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5307367444038391},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4713066518306732},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4204915165901184},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32433050870895386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18413084745407104},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:repository.upenn.edu:20.500.14332/6174","doi":null,"is_oa":false,"landing_page_url":"https://repository.upenn.edu/handle/20.500.14332/6174","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"},{"id":"pmh:oai:repository.upenn.edu:cis_papers-1215","doi":null,"is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/146","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},{"id":"mag:2013198217","doi":"https://doi.org/10.5555/338219.338254","is_oa":false,"landing_page_url":"http://cgi.di.uoa.gr/~vassilis/co/MultipleKP.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.7958","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~sanjeev/postscript/knapsack.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.8209","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.8209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ampl.com/cm/cs/who/chekuri/postscript/knapsack.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:repository.upenn.edu:cis_papers-1215","doi":null,"is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/146","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2013198217.pdf","grobid_xml":"https://content.openalex.org/works/W2013198217.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W964861289","https://openalex.org/W1480006018","https://openalex.org/W1509898203","https://openalex.org/W1556368910","https://openalex.org/W1825072153","https://openalex.org/W1991407520","https://openalex.org/W1992527911","https://openalex.org/W2011039300","https://openalex.org/W2014071862","https://openalex.org/W2014369282","https://openalex.org/W2024427769","https://openalex.org/W2026891055","https://openalex.org/W2031376842","https://openalex.org/W2031595762","https://openalex.org/W2032522336","https://openalex.org/W2055037276","https://openalex.org/W2062761494","https://openalex.org/W2066671865","https://openalex.org/W2071016718","https://openalex.org/W2076481663","https://openalex.org/W2102201348","https://openalex.org/W2113195911","https://openalex.org/W2123068254","https://openalex.org/W2145028977","https://openalex.org/W2576116471","https://openalex.org/W2808376720","https://openalex.org/W2922809901"],"related_works":["https://openalex.org/W2000444555","https://openalex.org/W2085922444","https://openalex.org/W2167596143","https://openalex.org/W2095673391","https://openalex.org/W7095266495","https://openalex.org/W2108285089","https://openalex.org/W4380538324","https://openalex.org/W1981417680","https://openalex.org/W2316551215","https://openalex.org/W2024427769"],"abstract_inverted_index":{"The":[0,54,138],"Multiple":[1],"Knapsackproblem":[2],"(MKP)":[3],"is":[4,17,56,77,105,109,116,144,181,224],"a":[5,24,39,43,51,59,70,78,112,145,159],"natural":[6],"and":[7,16,29,42,46,90,111,123,126,166,218,243],"well":[8],"known":[9,134],"generalization":[10,161],"of":[11,26,61,63,81,93,121,141,162,178,192,199,213,221,233],"the":[12,74,82,88,91,100,119,132,163,174,208],"single":[13],"knapsack":[14,165],"problem":[15,85],"defined":[18],"as":[19,158],"follows.":[20],"We":[21,184],"are":[22,195,201],"given":[23],"set":[25],"n":[27],"items":[28,62],"m":[30],"bins":[31],"(knapsacks)":[32],"such":[33,66],"that":[34,67,103,180,189,194],"each":[35,47],"item":[36,95],"i":[37],"has":[38,50],"profit":[40,65,89],"p(i)":[41],"size":[44,92],"s(i),":[45],"bin":[48,102,167],"j":[49],"capacity":[52],"c(j).":[53],"goal":[55],"to":[57,172,235],"find":[58],"subset":[60],"maximum":[64],"they":[68],"have":[69],"feasible":[71],"packing":[72,168],"in":[73,118],"bins.":[75],"MKP":[76,193,234],"special":[79,176],"case":[80,177],"Generalized":[83],"Assignment":[84],"(GAP)":[86],"where":[87],"an":[94,225,230,236],"can":[96],"vary":[97],"based":[98],"on":[99],"specific":[101],"it":[104,115,170],"assigned":[106],"to.":[107],"GAP":[108,179,200,214],"APX-hard":[110],"2-approximation":[113],"for":[114,136,150],"implicit":[117],"work":[120],"Shmoys":[122],"Tardos":[124],"[26],":[125],"thus":[127],"far,":[128],"this":[129,142,186],"was":[130],"also":[131],"best":[133],"approximation":[135,148,226],"MKP.":[137,151],"main":[139],"result":[140],"paper":[143],"polynomial":[146],"time":[147],"scheme":[149],"Apart":[152],"from":[153,229],"its":[154],"inherent":[155],"theoretical":[156],"interest":[157],"common":[160],"well-studied":[164],"problems,":[169],"appears":[171],"be":[173],"strongest":[175],"not":[182],"APX-hard.":[183,202],"substantiate":[185],"by":[187],"showing":[188],"slight":[190],"generalizations":[191],"very":[196],"restricted":[197],"versions":[198],"Thus":[203],"our":[204,222],"results":[205],"help":[206],"demarcate":[207],"boundary":[209],"at":[210],"which":[211],"instances":[212],"becomeAPX-hard.":[215],"An":[216],"interesting":[217],"novel":[219],"aspect":[220],"approach":[223],"preserving":[227],"reduction":[228],"arbitrary":[231],"instance":[232,237],"with":[238],"O(log":[239],"n)":[240],"distinct":[241],"sizes":[242],"profits.":[244]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2013198217","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":25},{"year":2014,"cited_by_count":26},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":17}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
