{"id":"https://openalex.org/W2029958010","doi":"https://doi.org/10.1137/100800245","title":"Optimal Homologous Cycles, Total Unimodularity, and Linear Programming","display_name":"Optimal Homologous Cycles, Total Unimodularity, and Linear Programming","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2029958010","doi":"https://doi.org/10.1137/100800245","mag":"2029958010"},"language":"en","primary_location":{"id":"doi:10.1137/100800245","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100800245","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5025354167","display_name":"Tamal K. Dey","orcid":"https://orcid.org/0000-0001-5160-9738"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tamal K. Dey","raw_affiliation_strings":["Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016423606","display_name":"Anil N. Hirani","orcid":"https://orcid.org/0000-0003-3506-1703"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anil N. Hirani","raw_affiliation_strings":["hirani@cs.illinois.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"hirani@cs.illinois.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102955818","display_name":"Bala Krishnamoorthy","orcid":"https://orcid.org/0000-0002-2727-6547"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bala Krishnamoorthy","raw_affiliation_strings":["bkrishna@math.wsu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"bkrishna@math.wsu.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.175,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.97539543,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"40","issue":"4","first_page":"1026","last_page":"1044"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":1.0,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":1.0,"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/T10896","display_name":"Homotopy and Cohomology in Algebraic Topology","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T10287","display_name":"Algebraic structures and combinatorial models","score":0.9678999781608582,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unimodular-matrix","display_name":"Unimodular matrix","score":0.9267410039901733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7495309114456177},{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"Simplicial complex","score":0.7188895344734192},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6597736477851868},{"id":"https://openalex.org/keywords/homology","display_name":"Homology (biology)","score":0.5255602598190308},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.48908692598342896},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48326045274734497},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4789334237575531},{"id":"https://openalex.org/keywords/simplicial-homology","display_name":"Simplicial homology","score":0.4354708194732666},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17632007598876953}],"concepts":[{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.9267410039901733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7495309114456177},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.7188895344734192},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6597736477851868},{"id":"https://openalex.org/C165525559","wikidata":"https://www.wikidata.org/wiki/Q224180","display_name":"Homology (biology)","level":3,"score":0.5255602598190308},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.48908692598342896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48326045274734497},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4789334237575531},{"id":"https://openalex.org/C3469331","wikidata":"https://www.wikidata.org/wiki/Q7520902","display_name":"Simplicial homology","level":3,"score":0.4354708194732666},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17632007598876953},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/100800245","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100800245","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.6346","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.6346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ohio-state.edu/~tamaldey/paper/homology-generators/homology.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.210.7775","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.210.7775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.wsu.edu/faculty/bkrishna/Papers/homology.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.2759","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.2759","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ohio-state.edu/~tamaldey/paper/homology-generators/homology.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.723.2779","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.2779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/%7Ehirani/papers/DeHiKr2011_SICOMP.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1972577005","https://openalex.org/W1972872923","https://openalex.org/W2040101882","https://openalex.org/W2045867632","https://openalex.org/W2103985627","https://openalex.org/W2110221038","https://openalex.org/W2118382603","https://openalex.org/W2130458586","https://openalex.org/W2150154671","https://openalex.org/W2199785256","https://openalex.org/W3013843370"],"related_works":["https://openalex.org/W2753007631","https://openalex.org/W287883068","https://openalex.org/W2953190840","https://openalex.org/W1992772797","https://openalex.org/W2969857904","https://openalex.org/W4288359443","https://openalex.org/W2943582562","https://openalex.org/W4297912386","https://openalex.org/W4206371202","https://openalex.org/W2118228880"],"abstract_inverted_index":{"Given":[0],"a":[1,10,49,114,130,148,163,189,229,245],"simplicial":[2,51,205],"complex":[3,52,206],"with":[4,22,38],"weights":[5],"on":[6,13],"its":[7],"simplices,":[8],"and":[9,67,85,117],"nontrivial":[11],"cycle":[12,21],"it,":[14],"we":[15,42,100],"are":[16,234],"interested":[17],"in":[18,80,129,137,144,166,182,188,208],"finding":[19,126,223],"the":[20,29,34,44,59,93,97,103,123,145,154],"minimal":[23],"weight":[24],"which":[25,106,151],"is":[26,36,63,72,107,142,156,165],"homologous":[27,227],"to":[28,169,228],"given":[30,131,190,230],"one.":[31],"Assuming":[32],"that":[33,153,178],"homology":[35,132,191],"defined":[37],"integer":[39,110,120],"($\\mathbb{Z}$)":[40],"coefficients,":[41],"show":[43],"following":[45],"(Theorem":[46],"5.2):":[47],"For":[48],"finite":[50,204],"K":[53,81],"of":[54,82,92,96,125,147,196,248],"dimension":[55],"greater":[56],"than":[57],"p,":[58],"boundary":[60,98],"matrix":[61],"$[\\partial_{p+1}]$":[62],"totally":[64],"unimodular":[65],"if":[66,69],"only":[68],"$H_p(L,":[70],"L_0)$":[71],"torsion-free":[73],"for":[74,193,202,217],"all":[75],"pure":[76],"subcomplexes":[77],"$L_0,":[78],"L$":[79],"dimensions":[83],"p":[84],"$p+1$,":[86],"respectively,":[87],"where":[88],"$L_0":[89],"\\subsetL$.":[90],"Because":[91],"total":[94,249],"unimodularity":[95],"matrix,":[99],"can":[101,134,180,213,239],"solve":[102],"optimization":[104,211],"problem,":[105,112],"inherently":[108],"an":[109,119,185,197,224],"programming":[111],"as":[113,222,243],"linear":[115],"program":[116],"obtain":[118],"solution.":[121],"Thus,":[122],"problem":[124,155],"optimal":[127,186,225],"cycles":[128],"class":[133,192],"be":[135,215,241],"solved":[136],"polynomial":[138,183],"time.":[139],"This":[140],"result":[141,150,173,238],"surprising":[143],"backdrop":[146],"recent":[149],"says":[152],"NP-hard":[157],"under":[158],"$\\mathbb{Z}_2$":[159],"coefficients":[160],"which,":[161],"being":[162],"field,":[164],"general":[167],"easier":[168],"deal":[170],"with.":[171],"Our":[172,210,237],"implies,":[174],"among":[175],"other":[176],"things,":[177],"one":[179,231],"compute":[181],"time":[184],"$(d-1)$-cycle":[187],"any":[194,203],"triangulation":[195],"orientable":[198],"compact":[199],"d-manifold":[200],"or":[201],"embedded":[207],"$\\mathbb{R}^d$.":[209],"approach":[212],"also":[214,240],"used":[216],"various":[218],"related":[219],"problems,":[220],"such":[221],"chain":[226],"when":[232],"these":[233],"not":[235],"cycles.":[236],"viewed":[242],"providing":[244],"topological":[246],"characterization":[247],"unimodularity.":[250]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}