{"id":"https://openalex.org/W7222993552","doi":"https://doi.org/10.48550/arxiv.2610.25955","title":"Bounded Integer Programming in Almost $N^{2d}$ Time","display_name":"Bounded Integer Programming in Almost $N^{2d}$ Time","publication_year":2026,"publication_date":"2026-10-19","ids":{"openalex":"https://openalex.org/W7222993552","doi":"https://doi.org/10.48550/arxiv.2610.25955"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.25955","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.25955","pdf_url":"https://arxiv.org/pdf/2610.25955","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.25955","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5159119283","display_name":"Lin Chen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5159125030","display_name":"Yuchen Mao","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mao, Yuchen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5157959687","display_name":"Guochuan Zhang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Guochuan","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":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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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.9970999956130981,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.0003000000142492354,"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/integer-programming","display_name":"integer programming","score":0.921999990940094},{"id":"https://openalex.org/keywords/deterministic-polynomial-time-algorithms","display_name":"deterministic polynomial-time algorithms","score":0.5989999771118164},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.35199999809265137},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.3700000047683716},{"id":"https://openalex.org/keywords/dimension-dependence","display_name":"dimension dependence","score":0.41999998688697815}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7390000224113464},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.7328000068664551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7184000015258789},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6965000033378601},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.532800018787384},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5209000110626221},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47769999504089355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4000000059604645},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.34940001368522644},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.25955","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.25955","pdf_url":"https://arxiv.org/pdf/2610.25955","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.25955","doi":"https://doi.org/10.48550/arxiv.2610.25955","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.25955","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.25955","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.25955","pdf_url":"https://arxiv.org/pdf/2610.25955","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"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/W7222993552.pdf","grobid_xml":"https://content.openalex.org/works/W7222993552.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W2047384482","https://openalex.org/W2726911201","https://openalex.org/W2756196199","https://openalex.org/W4388327661","https://openalex.org/W7221528956","https://openalex.org/W7222852306"],"related_works":["https://openalex.org/W2305357766","https://openalex.org/W2600129778","https://openalex.org/W2090543420","https://openalex.org/W2245100268","https://openalex.org/W2521625024","https://openalex.org/W4242076231","https://openalex.org/W2158468869","https://openalex.org/W2082437955","https://openalex.org/W4411188167","https://openalex.org/W2141360684"],"abstract_inverted_index":{"We":[0,120],"study":[1],"integer":[2],"programs":[3],"in":[4,64,118],"standard":[5],"form":[6],"$\\min\\{\\mathbf{c}^{\\mathsf":[7],"T}\\mathbf{x}:A\\mathbf{x}=\\mathbf{b},\\mathbf{l}\\leq\\mathbf{x}\\leq\\mathbf{u},\\":[8],"\\mathbf{x}\\in\\mathbb{Z}^n\\}$,":[9],"where":[10,70],"$A\\in\\mathbb{Z}^{d\\times":[11],"n}$,":[12],"all":[13],"entries":[14,37],"of":[15,35,38,47],"$\\mathbf{b},\\mathbf{c},\\mathbf{l},\\mathbf{u}$":[16],"are":[17],"integers,":[18],"and":[19,40,54,100],"every":[20,51,55],"variable":[21],"bound":[22,30],"is":[23,73],"finite.":[24],"Let":[25],"$N$":[26],"be":[27,113],"an":[28],"upper":[29],"on":[31,43],"the":[32,36,44,48,74,87,109,126],"absolute":[33,45],"values":[34,46],"$A$,":[39],"$c_{\\max}$":[41],"one":[42,78,116],"costs.":[49],"For":[50],"fixed":[52,56],"$d$":[53],"$\\varepsilon>0$":[57],"we":[58],"give":[59],"a":[60,104],"deterministic":[61],"algorithm":[62],"running":[63,90],"time":[65,75,91],"\\[":[66],"T_{\\textrm":[67],"LP}+O_d(n)+O_{d,\\varepsilon}\\bigl(N^{2d+\\varepsilon}\\log^2(c_{\\max}+2)\\bigr),":[68],"\\]":[69],"$T_{\\textrm":[71],"LP}$":[72],"to":[76,84,115],"solve":[77],"linear":[79,117],"programming":[80],"relaxation":[81],"exactly.":[82],"Prior":[83],"our":[85],"work,":[86],"best":[88],"known":[89],"for":[92],"bounded":[93],"variables":[94],"was":[95],"$N^{O(d^2)}$":[96],"[Eisenbrand":[97],"\\&":[98],"Weismantel'20],":[99],"it":[101],"has":[102],"been":[103],"fundamental":[105],"open":[106],"problem":[107],"whether":[108],"exponent":[110,127],"$O(d^2)$":[111],"can":[112],"improved":[114],"$d$.":[119],"answer":[121],"this":[122],"question":[123],"affirmatively,":[124],"with":[125],"$2d+\\varepsilon$.":[128]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2026-10-21T00:00:00"}