{"id":"https://openalex.org/W2904298817","doi":"https://doi.org/10.4086/toc.2018.v014a014","title":"","display_name":"","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2904298817","doi":"https://doi.org/10.4086/toc.2018.v014a014","mag":"2904298817"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2018.v014a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a014","pdf_url":"http://www.theoryofcomputing.org/articles/v014a014/v014a014.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v014a014/v014a014.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061217984","display_name":"Abbas Bazzi","orcid":"https://orcid.org/0000-0001-7273-3746"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abbas Bazzi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001781037","display_name":"Samuel Fiorini","orcid":"https://orcid.org/0000-0002-6845-9008"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samuel Fiorini","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047872044","display_name":"Sangxia Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sangxia Huang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.19007801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.993399977684021,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9914000034332275,"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.8801721334457397},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7566437721252441},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7204297184944153},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6717767715454102},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6173008680343628},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6013674736022949},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5787599682807922},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5744269490242004},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5220315456390381},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48428839445114136},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.46582266688346863},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45633596181869507},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.42606157064437866},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.37378162145614624},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27061933279037476}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8801721334457397},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7566437721252441},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7204297184944153},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6717767715454102},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6173008680343628},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6013674736022949},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5787599682807922},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5744269490242004},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5220315456390381},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48428839445114136},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.46582266688346863},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45633596181869507},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.42606157064437866},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.37378162145614624},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27061933279037476},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4086/toc.2018.v014a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a014","pdf_url":"http://www.theoryofcomputing.org/articles/v014a014/v014a014.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/286969","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/286969","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"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":"Theory of computing, 14","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:infoscience.epfl.ch:261755","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/152145","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"}],"best_oa_location":{"id":"doi:10.4086/toc.2018.v014a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a014","pdf_url":"http://www.theoryofcomputing.org/articles/v014a014/v014a014.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2904298817.pdf","grobid_xml":"https://content.openalex.org/works/W2904298817.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W772046056","https://openalex.org/W1574334008","https://openalex.org/W1587590810","https://openalex.org/W1662824729","https://openalex.org/W1755753347","https://openalex.org/W1909205607","https://openalex.org/W1933011002","https://openalex.org/W1964001041","https://openalex.org/W1967232806","https://openalex.org/W1967535666","https://openalex.org/W1972982762","https://openalex.org/W1984628625","https://openalex.org/W2023307697","https://openalex.org/W2031923588","https://openalex.org/W2046898063","https://openalex.org/W2049016755","https://openalex.org/W2061055380","https://openalex.org/W2064366623","https://openalex.org/W2065139435","https://openalex.org/W2097673705","https://openalex.org/W2113195911","https://openalex.org/W2120803616","https://openalex.org/W2124452917","https://openalex.org/W2150285483","https://openalex.org/W2167525805","https://openalex.org/W2171564145","https://openalex.org/W2401610261","https://openalex.org/W2570727021","https://openalex.org/W2593080689","https://openalex.org/W2611857909","https://openalex.org/W2759253428","https://openalex.org/W2788289283","https://openalex.org/W2892107877","https://openalex.org/W2905904719","https://openalex.org/W2949327577","https://openalex.org/W2963010019","https://openalex.org/W2963276484","https://openalex.org/W3022030295","https://openalex.org/W4205962651","https://openalex.org/W4226347946","https://openalex.org/W4244934433","https://openalex.org/W4299376148"],"related_works":["https://openalex.org/W3125086224","https://openalex.org/W4287815058","https://openalex.org/W4214914101","https://openalex.org/W2123068254","https://openalex.org/W3196775331","https://openalex.org/W3213429012","https://openalex.org/W2256089709","https://openalex.org/W4287689012","https://openalex.org/W4287025685","https://openalex.org/W3049215996"],"abstract_inverted_index":{"Initially":[0],"developed":[1],"for":[2,17,96,151,164,201,237],"the":[3,6,13,78,83,119,138,152,231,248,251],"min-knapsack":[4,84],"problem,":[5,86],"knapsack":[7,79],"cover":[8,80,85,156],"inequalities":[9,32,157],"are":[10,69,143,159],"used":[11,160],"in":[12,51,247],"current":[14],"best":[15],"relaxations":[16,37,64,163],"numerous":[18,232],"combinatorial":[19],"optimization":[20],"problems":[21],"of":[22,27,38,65,112,121,129,221,243,250],"covering":[23],"type.":[24],"In":[25,54,187],"spite":[26],"their":[28],"widespread":[29],"use,":[30],"these":[31],"yield":[33],"linear":[34],"programming":[35],"(LP)":[36],"exponential":[39],"size,":[40],"over":[41],"which":[42],"it":[43],"is":[44,102,118,172,191],"not":[45],"known":[46,127],"how":[47],"to":[48,147,161,226],"optimize":[49],"exactly":[50],"polynomial":[52],"time.":[53],"this":[55,59,222,244],"paper":[56,245],"we":[57],"address":[58],"issue":[60],"and":[61,166,180,213],"obtain":[62],"LP":[63,106,190],"quasi-polynomial":[66],"size":[67,131],"that":[68,75,158,217],"at":[70,113],"least":[71],"as":[72,74,94,209],"strong":[73],"given":[76],"by":[77,174,211],"inequalities.":[81],"For":[82],"our":[87,189],"main":[88],"result":[89],"can":[90],"be":[91],"stated":[92],"formally":[93],"follows:":[95],"any":[97],"$\\varepsilon":[98],">":[99],"0$,":[100],"there":[101,124],"a":[103,133,175,218],"$(1/\\varepsilon)^{O(1)}n^{O(\\log":[104],"n)}$-size":[105],"relaxation":[107,128],"with":[108,132,198,206],"an":[109],"integrality":[110,139],"gap":[111],"most":[114],"$2+\\varepsilon$,":[115],"where":[116],"$n$":[117,207],"number":[120],"items.":[122],"Previously,":[123],"was":[125],"no":[126],"subexponential":[130],"constant":[134],"upper":[135],"bound":[136],"on":[137,193,255],"gap.":[140],"Our":[141,170],"techniques":[142],"also":[144],"sufficiently":[145],"versatile":[146],"give":[148],"analogous":[149],"results":[150,229],"closely":[153],"related":[154],"flow":[155],"strengthen":[162],"scheduling":[165],"facility":[167],"location":[168],"problems.":[169],"construction":[171],"inspired":[173],"connection":[176,223],"between":[177],"extended":[178,238],"formulations":[179],"monotone":[181,196],"circuit":[182],"complexity":[183],"via":[184],"Karchmer-Wigderson":[185],"games.":[186],"particular,":[188],"based":[192],"$O(\\log^2":[194],"n)$-depth":[195],"circuits":[197],"fan-in":[199],"$2$":[200],"evaluating":[202],"weighted":[203],"threshold":[204],"functions":[205],"inputs,":[208],"constructed":[210],"Beimel":[212],"Weinreb.":[214],"We":[215],"believe":[216],"further":[219],"understanding":[220],"may":[224],"lead":[225],"more":[227],"positive":[228],"complementing":[230],"lower":[233],"bounds":[234],"recently":[235],"proved":[236],"formulations.":[239],"A":[240],"conference":[241],"version":[242],"appeared":[246],"Proceedings":[249],"28th":[252],"ACM-SIAM":[253],"Symposium":[254],"Discrete":[256],"Algorithms":[257],"(SODA":[258],"2017).":[259]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2018-12-22T00:00:00"}