{"id":"https://openalex.org/W7154350719","doi":"https://doi.org/10.48550/arxiv.2604.09806","title":"Algorithms for Standard-form ILP Problems via Koml\u00f3s' Discrepancy Setting","display_name":"Algorithms for Standard-form ILP Problems via Koml\u00f3s' Discrepancy Setting","publication_year":2026,"publication_date":"2026-04-10","ids":{"openalex":"https://openalex.org/W7154350719","doi":"https://doi.org/10.48550/arxiv.2604.09806"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.09806","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09806","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.09806","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023191008","display_name":"Dmitry Gribanov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gribanov, Dmitry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Khayaleyev, Tagir","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khayaleyev, Tagir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133569631","display_name":"Mikhail Cherniavskii","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cherniavskii, Mikhail","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133605365","display_name":"Maxim Klimenko","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klimenko, Maxim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133614090","display_name":"Dmitry Malyshev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Malyshev, Dmitry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133575332","display_name":"Stanislav Moiseev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moiseev, Stanislav","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T12404","display_name":"Mathematical Approximation and Integration","score":0.9811000227928162,"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"}},"topics":[{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.9811000227928162,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.0031999999191612005,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0026000000070780516,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.5751000046730042},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4991999864578247},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.484499990940094},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.47360000014305115},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.46299999952316284},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4496000111103058},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4244999885559082},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4223000109195709}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6632999777793884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6089000105857849},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5751000046730042},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4991999864578247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.484499990940094},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.47360000014305115},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.46299999952316284},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4496000111103058},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3953999876976013},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3781999945640564},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3449999988079071},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.34290000796318054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33980000019073486},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.32580000162124634},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30320000648498535},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25949999690055847},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.09806","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09806","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":"doi:10.48550/arxiv.2604.09806","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09806","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,27],"study":[1],"the":[2,37,64,86,89,99,107,125,128],"standard-form":[3],"ILP":[4],"problem":[5,91,102],"$\\max\\{":[6],"c^\\top":[7],"x":[8,11,14],"\\colon":[9],"A":[10],"=":[12],"b,\\;":[13],"\\in":[15],"Z_{\\geq":[16],"0}^n":[17],"\\}$,":[18],"where":[19],"$A\\in":[20],"Z^{k\\times":[21],"n}$":[22],"has":[23],"full":[24],"row":[25],"rank.":[26],"obtain":[28],"refined":[29],"FPT":[30],"algorithms":[31],"parameterized":[32],"by":[33],"$k$":[34,71,131],"and":[35,98,120],"$\u0394$,":[36],"maximum":[38,65],"absolute":[39],"value":[40],"of":[41,46],"a":[42],"$k\\times":[43],"k$":[44],"minor":[45],"$A$.":[47],"Our":[48],"approach":[49],"combines":[50],"discrepancy-based":[51],"dynamic":[52],"programming":[53],"with":[54,70],"matrix":[55],"discrepancy":[56,66],"bounds":[57],"in":[58,85,95,103,132],"Koml\u00f3s'":[59],"setting.":[60],"Let":[61],"$\u03ba_k$":[62],"denote":[63],"over":[67],"all":[68],"matrices":[69],"columns":[72,74],"whose":[73],"have":[75],"Euclidean":[76],"norm":[77],"at":[78],"most":[79],"$1$.":[80],"Up":[81],"to":[82,137],"polynomial":[83],"factors":[84],"input":[87],"size,":[88],"optimization":[90],"can":[92],"be":[93],"solved":[94],"time":[96,104],"$O(\u03ba_k)^{2k}\u0394^2$,":[97],"corresponding":[100],"feasibility":[101],"$O(\u03ba_k)^k\u0394$.":[105],"Using":[106],"best":[108],"currently":[109],"known":[110],"bound":[111],"$\u03ba_k=\\widetilde":[112],"O(\\log^{1/4}k)$,":[113],"this":[114],"yields":[115],"running":[116,134],"times":[117,135],"$O(\\log":[118,121],"k)^{\\frac{k}{2}(1+o(1))}\u0394^2$":[119],"k)^{\\frac{k}{4}(1+o(1))}\u0394$,":[122],"respectively.":[123],"Under":[124],"Koml\u00f3s":[126],"conjecture,":[127],"dependence":[129],"on":[130],"both":[133],"reduces":[136],"$2^{O(k)}$.":[138]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-15T00:00:00"}