{"id":"https://openalex.org/W2968986948","doi":"https://doi.org/10.1145/3338512","title":"Faster Approximation Schemes for the Two-Dimensional Knapsack Problem","display_name":"Faster Approximation Schemes for the Two-Dimensional Knapsack Problem","publication_year":2019,"publication_date":"2019-08-08","ids":{"openalex":"https://openalex.org/W2968986948","doi":"https://doi.org/10.1145/3338512","mag":"2968986948"},"language":"en","primary_location":{"id":"doi:10.1145/3338512","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3338512","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/A5023385398","display_name":"Sandy Heydrich","orcid":"https://orcid.org/0000-0002-7724-2644"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sandy Heydrich","raw_affiliation_strings":["Max Planck Institute for Informatics and Graduate School of Computer Science, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7724-2644","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics and Graduate School of Computer Science, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067503013","display_name":"Andreas Wiese","orcid":"https://orcid.org/0000-0003-3705-016X"},"institutions":[{"id":"https://openalex.org/I69737025","display_name":"University of Chile","ror":"https://ror.org/047gc3g35","country_code":"CL","type":"education","lineage":["https://openalex.org/I69737025"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Andreas Wiese","raw_affiliation_strings":["Universidad de Chile, Santiago, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad de Chile, Santiago, Chile","institution_ids":["https://openalex.org/I69737025"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023385398"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":0.6628,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76604521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":"4","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9571924209594727},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.8091713190078735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6564128994941711},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6040889620780945},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5593194365501404},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5490803718566895},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5471354126930237},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5014052391052246},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4754733145236969},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4444364309310913},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4352520704269409},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.413874089717865},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38601958751678467},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3854029178619385}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9571924209594727},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.8091713190078735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6564128994941711},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6040889620780945},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5593194365501404},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5490803718566895},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5471354126930237},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5014052391052246},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4754733145236969},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4444364309310913},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4352520704269409},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.413874089717865},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38601958751678467},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3854029178619385},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3338512","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3338512","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:fraunhofer.de:N-630375","is_oa":false,"landing_page_url":"http://publica.fraunhofer.de/documents/N-630375.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400801","display_name":"Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fraunhofer ITWM","raw_type":"Journal Article"},{"id":"pmh:oai:publica.fraunhofer.de:publica/267339","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/267339","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"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":"journal article"},{"id":"pmh:vu:oai:research.vu.nl:publications/5e91e0ce-a8e5-4aa9-be0e-20f71a1cefbf","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/5e91e0ce-a8e5-4aa9-be0e-20f71a1cefbf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Trans. Algorithms, 15(4), 47:1 - 47:28","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W89929351","https://openalex.org/W1517042457","https://openalex.org/W1517789689","https://openalex.org/W1530649098","https://openalex.org/W1550969978","https://openalex.org/W1554636509","https://openalex.org/W1764956874","https://openalex.org/W1843208812","https://openalex.org/W1982525473","https://openalex.org/W1997959089","https://openalex.org/W2005357504","https://openalex.org/W2014369282","https://openalex.org/W2060963575","https://openalex.org/W2067823599","https://openalex.org/W2067912448","https://openalex.org/W2098666887","https://openalex.org/W2142941794","https://openalex.org/W2404196336","https://openalex.org/W2537875490","https://openalex.org/W2770216739","https://openalex.org/W2773669864","https://openalex.org/W2774720496","https://openalex.org/W2962917430","https://openalex.org/W4292920247","https://openalex.org/W4389615663"],"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":{"For":[0],"geometric":[1,81],"optimization":[2],"problems":[3,82],"we":[4,87,156,164,197,233],"often":[5],"understand":[6],"the":[7,25,44,115,120,142,150,177,209,213,262,278],"computational":[8],"complexity":[9],"on":[10,18,69,126],"a":[11,19,33,41,98,102,172,187,221,272],"rough":[12],"scale,":[13],"but":[14,43],"not":[15,124],"very":[16],"well":[17],"finer":[20],"scale.":[21],"One":[22],"example":[23],"is":[24,32,50,71,149],"two-dimensional":[26,253],"knapsack":[27,94,254],"problem":[28,143],"for":[29,38,79,93,95,141,208,252,255],"squares.":[30,211],"There":[31],"polynomial":[34,136],"time":[35,46,104,122,137,223],"(1+\u03b5)-approximation":[36,99],"algorithm":[37,49,100,251],"it":[39],"(i.e.,":[40],"PTAS)":[42],"running":[45,103,121,222],"of":[47,105,117,153,186,192,206,217,224],"this":[48,75,85,148,162],"triple":[51,66],"exponential":[52,67],"in":[53,73,119],"1/\u03b5,":[54],"i.e.,":[55,97],"\u03a9":[56,178,225],"(":[57,226],"n":[58,109,118,227,240],"2":[59,60,180,228,229],"1/\u03b5":[61,70,181,230],").":[62],"A":[63],"double":[64],"or":[65],"dependence":[68],"inherent":[72],"how":[74],"and":[76,232,269],"other":[77,80],"algorithms":[78],"work.":[83],"In":[84,113,212],"article,":[86],"present":[88,171],"an":[89,199,250,267,283],"efficient":[90],"PTAS":[91,265,280],"(EPTAS)":[92],"squares,":[96],"with":[101,274],"O":[106,110,237,241],"\u03b5":[107,127,238],"(1)\u22c5":[108,239],"(1)":[111,242],".":[112,243],"particular,":[114],"exponent":[116],"does":[123],"depend":[125],"at":[128],"all!":[129],"Since":[130],"there":[131],"can":[132,157],"be":[133],"no":[134],"fully":[135],"approximation":[138,154],"scheme":[139,155],"(FPTAS)":[140],"(unless":[144],"P":[145],"=":[146],"NP),":[147],"best":[151],"kind":[152],"hope":[158],"for.":[159],"To":[160],"achieve":[161],"improvement,":[163],"introduce":[165,198],"two":[166],"new":[167],"key":[168],"ideas:":[169],"We":[170,244,260],"fast":[173],"method":[174],"to":[175,203,236,266],"guess":[176],"(2":[179],")":[182,231],"relatively":[183],"large":[184],"squares":[185],"suitable":[188],"near-optimal":[189],"packing":[190],"instead":[191],"using":[193],"brute-force":[194],"enumeration.":[195],"Secondly,":[196],"indirect":[200],"guessing":[201],"framework":[202],"define":[204],"sizes":[205],"cells":[207],"remaining":[210],"previous":[214,263,279],"PTAS,":[215],"each":[216],"these":[218],"steps":[219],"needs":[220],"improve":[234,261],"both":[235],"complete":[245],"our":[246],"result":[247],"by":[248],"giving":[249],"rectangles":[256],"under":[257],"(1+\u03b5)-resource":[258],"augmentation.":[259],"double-exponential":[264],"EPTAS":[268],"compute":[270],"even":[271],"solution":[273],"optimal":[275],"weight,":[276],"while":[277],"computes":[281],"only":[282],"approximation.":[284]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}