{"id":"https://openalex.org/W4386384716","doi":"https://doi.org/10.48550/arxiv.2308.16711","title":"Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack","display_name":"Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack","publication_year":2023,"publication_date":"2023-08-31","ids":{"openalex":"https://openalex.org/W4386384716","doi":"https://doi.org/10.48550/arxiv.2308.16711"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2308.16711","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2308.16711","pdf_url":"https://arxiv.org/pdf/2308.16711","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2308.16711","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042936703","display_name":"Jamico Schade","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Schade, Jamico","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025592127","display_name":"Makrand Sinha","orcid":"https://orcid.org/0000-0001-5702-2049"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sinha, Makrand","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5023809656","display_name":"Stefan Weltge","orcid":"https://orcid.org/0000-0002-0102-8326"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weltge, Stefan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042936703"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9957000017166138,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9799000024795532,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.858121931552887},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8432667851448059},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8008691072463989},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7487694025039673},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6713874340057373},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5861967206001282},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5692994594573975},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4828839600086212},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4550541043281555},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4527684450149536},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4481045603752136},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4356482923030853},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4334956705570221},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.41586920619010925},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11849239468574524},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08406174182891846}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.858121931552887},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8432667851448059},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8008691072463989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7487694025039673},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6713874340057373},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5861967206001282},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5692994594573975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4828839600086212},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4550541043281555},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4527684450149536},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4481045603752136},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4356482923030853},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4334956705570221},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.41586920619010925},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11849239468574524},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08406174182891846},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2308.16711","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2308.16711","pdf_url":"https://arxiv.org/pdf/2308.16711","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2308.16711","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2308.16711","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2308.16711","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2308.16711","pdf_url":"https://arxiv.org/pdf/2308.16711","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2363520468","display_name":null,"funder_award_id":"277991500","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5106512922","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7305375270","display_name":null,"funder_award_id":"451026932","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7438081712","display_name":null,"funder_award_id":"277991500/GRK2201","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4386384716.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1967232806","https://openalex.org/W4377371889","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W4389362338","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W78560857","https://openalex.org/W4389820491"],"abstract_inverted_index":{"Standard":[0],"mixed-integer":[1],"programming":[2],"formulations":[3,141],"for":[4,30,50,97,100,135],"the":[5,59,91,115,132,136],"stable":[6,87],"set":[7,88],"problem":[8],"on":[9],"$n$-node":[10,28,84],"graphs":[11,29,85],"require":[12],"$n$":[13],"integer":[14,39],"variables.":[15,40],"We":[16,23],"prove":[17],"that":[18,78],"this":[19,57,74],"is":[20],"almost":[21],"optimal:":[22],"give":[24],"a":[25,42,81],"family":[26,82],"of":[27,63,83,138],"which":[31],"every":[32],"polynomial-size":[33],"MIP":[34],"formulation":[35,96],"requires":[36],"$\u03a9(n/\\log^2":[37],"n)$":[38,65],"By":[41],"polyhedral":[43],"reduction":[44],"we":[45,76],"obtain":[46],"an":[47],"analogous":[48],"result":[49,134],"$n$-item":[51],"knapsack":[52],"problems.":[53],"In":[54],"both":[55],"cases,":[56],"improves":[58],"previously":[60],"known":[61],"bounds":[62],"$\u03a9(\\sqrt{n}/\\log":[64],"by":[66],"Cevallos,":[67],"Weltge":[68],"&":[69,122],"Zenklusen":[70],"(SODA":[71],"2018).":[72],"To":[73],"end,":[75],"show":[77],"there":[79],"exists":[80],"whose":[86],"polytopes":[89],"satisfy":[90],"following:":[92],"any":[93],"$(1+\\varepsilon/n)$-approximate":[94],"extended":[95,140],"these":[98],"polytopes,":[99],"some":[101],"constant":[102],"$\\varepsilon":[103,143],">":[104],"0$,":[105],"has":[106],"size":[107],"$2^{\u03a9(n/\\log":[108],"n)}$.":[109],"Our":[110],"proof":[111],"extends":[112],"and":[113],"simplifies":[114],"information-theoretic":[116],"methods":[117],"due":[118],"to":[119],"G\u00f6\u00f6s,":[120],"Jain":[121],"Watson":[123],"(FOCS":[124],"2016,":[125],"SIAM":[126],"J.":[127],"Comput.":[128],"2018)":[129],"who":[130],"showed":[131],"same":[133],"case":[137],"exact":[139],"(i.e.":[142],"=":[144],"0$).":[145]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2023-09-02T00:00:00"}