{"id":"https://openalex.org/W2050352628","doi":"https://doi.org/10.1145/1806689.1806785","title":"Odd cycle packing","display_name":"Odd cycle packing","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2050352628","doi":"https://doi.org/10.1145/1806689.1806785","mag":"2050352628"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806785","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806785","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5008961593","display_name":"Ken\u2010ichi Kawarabayashi","orcid":"https://orcid.org/0000-0001-6056-4287"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken-ichi Kawarabayashi","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan","(National Institute of Informatics, Tokyo, Japan)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"(National Institute of Informatics, Tokyo, Japan)","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108103165","display_name":"Bruce Reed","orcid":"https://orcid.org/0009-0002-5656-8941"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Bruce Reed","raw_affiliation_strings":["McGill University, Montreal, Canada","McGill University; Montreal; Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McGill University, Montreal, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"McGill University; Montreal; Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3832,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95037498,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"695","last_page":"704"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9955999851226807,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/combinatorics","display_name":"Combinatorics","score":0.8082554340362549},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.7141055464744568},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6964448094367981},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6803018450737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6271244287490845},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.5578455328941345},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5323989987373352},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5034367442131042},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4600823223590851},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4329605996608734},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42578500509262085},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4043900668621063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16383454203605652},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09504672884941101}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8082554340362549},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.7141055464744568},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6964448094367981},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6803018450737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6271244287490845},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.5578455328941345},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5323989987373352},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5034367442131042},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4600823223590851},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4329605996608734},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42578500509262085},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4043900668621063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16383454203605652},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09504672884941101},{"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/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1806689.1806785","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806785","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":74,"referenced_works":["https://openalex.org/W10105891","https://openalex.org/W100926944","https://openalex.org/W132145278","https://openalex.org/W594463866","https://openalex.org/W1481873605","https://openalex.org/W1509664253","https://openalex.org/W1509794588","https://openalex.org/W1513400187","https://openalex.org/W1514063965","https://openalex.org/W1539023454","https://openalex.org/W1552512816","https://openalex.org/W1558321388","https://openalex.org/W1572447597","https://openalex.org/W1965737603","https://openalex.org/W1972515959","https://openalex.org/W1984537627","https://openalex.org/W1984897155","https://openalex.org/W1991755800","https://openalex.org/W1996575062","https://openalex.org/W2002101153","https://openalex.org/W2002722727","https://openalex.org/W2003311624","https://openalex.org/W2005079828","https://openalex.org/W2008440715","https://openalex.org/W2011911122","https://openalex.org/W2018732791","https://openalex.org/W2020187144","https://openalex.org/W2024931493","https://openalex.org/W2028037658","https://openalex.org/W2032222063","https://openalex.org/W2035409201","https://openalex.org/W2040101882","https://openalex.org/W2046069847","https://openalex.org/W2046999257","https://openalex.org/W2047577363","https://openalex.org/W2047871605","https://openalex.org/W2047993669","https://openalex.org/W2051655695","https://openalex.org/W2051856222","https://openalex.org/W2057826895","https://openalex.org/W2058821164","https://openalex.org/W2059021689","https://openalex.org/W2059372025","https://openalex.org/W2059563583","https://openalex.org/W2060363698","https://openalex.org/W2060765530","https://openalex.org/W2061980451","https://openalex.org/W2062574277","https://openalex.org/W2071321409","https://openalex.org/W2073705438","https://openalex.org/W2079300367","https://openalex.org/W2081145725","https://openalex.org/W2085348754","https://openalex.org/W2091757422","https://openalex.org/W2096113666","https://openalex.org/W2097289283","https://openalex.org/W2115589427","https://openalex.org/W2130481157","https://openalex.org/W2132677029","https://openalex.org/W2135517930","https://openalex.org/W2151438396","https://openalex.org/W2151617868","https://openalex.org/W2158421820","https://openalex.org/W2159330890","https://openalex.org/W2165303918","https://openalex.org/W2166232733","https://openalex.org/W2170758948","https://openalex.org/W2331163766","https://openalex.org/W2335288698","https://openalex.org/W2336629689","https://openalex.org/W2569646339","https://openalex.org/W2912381149","https://openalex.org/W4210246355","https://openalex.org/W4319589071"],"related_works":["https://openalex.org/W143702185","https://openalex.org/W1988947197","https://openalex.org/W3093083067","https://openalex.org/W1587509797","https://openalex.org/W4300501056","https://openalex.org/W2765600275","https://openalex.org/W2953710272","https://openalex.org/W2107228433","https://openalex.org/W4236436085","https://openalex.org/W4255598955"],"abstract_inverted_index":{"We":[0,33,79,300,394,439,456,539,581],"consider":[1,35,264],"the":[2,8,36,41,70,82,86,90,121,173,182,198,213,223,241,256,260,265,268,283,291,296,312,316,319,328,341,365,386,403,408,426,429,441,450,477,482,509,526,529,543,565,573,596,602],"following":[3],"problem,":[4],"which":[5,112,445,463,514,549],"is":[6,49,60,95,100,139,146,189,197,208,236,274,277,315,327,340,424,446],"called":[7],"odd":[9,31,91,109,123,150,161,185,216,226,246,271,383,442,460],"cycle":[10,92,110,124,151,162,186,217,227,247,384],"packing":[11,93,125,152,187,218,228,248],"problem.":[12,229,605],"Input:":[13],"A":[14],"graph":[15,141,297,574],"$G$":[16],"with":[17,385,471,476],"n":[18],"vertices":[19],"and":[20,23,40,43,73,134,243,288,353,415,531,556,570,589],"m":[21,196],"edges,":[22],"an":[24,104,108,116,131,147,237,302,459,535],"integer":[25],"k.":[26,393,420],"Output:":[27],"k":[28,59,380,409,483],"vertex":[29],"disjoint":[30,38,160,292,382,484,603],"cycles.":[32],"also":[34,221,395,457,541,582],"edge":[37,381],"case,":[39],"node-":[42,242],"arc-disjoint":[44,224],"directed":[45,184,215,225,245],"case.":[46],"This":[47,98,207,276,326,347,562],"problem":[48,94,126,188,219,294,335,412,486],"known":[50],"to":[51,106,115,130,168,191,373,402,480,497,559,594],"be":[52,371,465],"NP-hard,":[53],"even":[54],"for":[55,76,120,179,212,222,240,281,290,307,333,364,390,407,417,487,572,578,601],"planar":[56],"graphs,":[57],"if":[58],"part":[61,563],"of":[62,85,89,200,202,270,286,318,428,449,511,528,545,568,587,598],"input.":[63],"In":[64,230],"this":[65,251,334],"paper,":[66],"we":[67,176,232,263,494,515,523,550],"first":[68,329,342],"present":[69,301],"integrality":[71,83],"gap":[72,84],"hardness":[74,174,257],"results":[75,586],"these":[77],"problems.":[78,249],"prove":[80,177,233,595],"that":[81,137,144,178,234,397,591],"standard":[87],"LP-relaxation":[88],"\u0398":[96],"(\u221an).":[97],"result":[99,285,567],"obtained":[101],"by":[102,135,323,351,413,454],"giving":[103],"algorithm":[105,119,239,253,306,332,363,369,399,423,434,479,600],"compute":[107],"packing,":[111],"gives":[113,128,166,400],"rise":[114,129,167,401],"O(\u221an)":[117,148],"approximating":[118],"fractional":[122],"(this":[127,165],"upper":[132],"bound),":[133],"showing":[136],"there":[138,145,156,235],"a":[140,169,203,278,349,360,447,468,500,505,519,554],"G":[142,164,378],"such":[143,518,553],"half-integral":[149],"in":[153,163,295,337,355,491,513,548],"G,":[154],"but":[155,220],"are":[157,592],"no":[158],"two":[159],"lower":[170],"bound).":[171],"For":[172,259],"result,":[175],"any":[180,308,391,418,488],"\u03b5,":[181],"node-disjoint":[183,214],"NP-hard":[190],"approximate":[192],"within":[193],"m1/2-\u03b5,":[194],"where":[195,311],"number":[199,269],"arcs":[201],"given":[204],"digraph":[205],"G.":[206],"true":[209],"not":[210,377],"only":[211,533],"addition,":[231],"O(m1/2)-approximation":[238],"arc-":[244],"Thus":[250,421],"approximation":[252],"almost":[254],"matches":[255],"result.":[258],"positive":[261],"side,":[262],"case":[266,366],"when":[267],"cycles,":[272],"k,":[273,310,490],"fixed.":[275],"natural":[279],"direction,":[280],"example,":[282],"seminal":[284,566],"Robertson":[287,414,569,588],"Seymour":[289,416,571,590],"paths":[293,411,485,604],"minors":[298],"project.":[299],"O(m":[303],"\u03b1(m,n)":[304,314],"n)":[305],"fixed":[309,343,392,419,489],"function":[313,321],"inverse":[317],"Ackermann":[320],"(see":[322],"Tarjan":[324],"[72]).":[325],"polynomial":[330,361],"time":[331,362,388],"(and":[336],"fact,":[338],"it":[339],"parameter":[344],"tractable":[345],"algorithm).":[346],"proves":[348],"conjecture":[350],"Lovasz":[352],"Schrijver":[354],"early":[356],"1980's,":[357],"who":[358],"gave":[359],"k=2.":[367],"Our":[368,433],"can":[370,464,532],"applied":[372],"decide":[374],"whether":[375],"or":[376,507],"has":[379,435],"same":[387],"complexity":[389],"show":[396],"our":[398,422],"Graph":[404,430],"Minor":[405,431],"Algorithm":[406],"vertex-disjoint":[410],"beyond":[425],"framework":[427],"Theory.":[432],"several":[436],"appealing":[437],"features:":[438],"use":[440,499,534,583],"S-path":[443],"theorem,":[444],"generalization":[448],"well-known":[451],"S-paths":[452],"theorem":[453,577],"Mader.":[455],"introduce":[458],"clique":[461,469,502,537],"minor,":[462],"viewed":[466],"as":[467,504],"minor":[470,503,555,575],"some":[472,584],"parity":[473,527],"condition.":[474],"As":[475],"Robertson-Seymour":[478],"solve":[481],"each":[492],"iteration,":[493],"would":[495],"like":[496],"either":[498],"huge":[501],"\"crossbar\",":[506],"exploit":[508,560],"structure":[510,544],"graphs":[512,547],"cannot":[516,551],"find":[517,552],"minor.":[520],"Here,":[521],"however,":[522],"must":[524,540],"maintain":[525],"cycles":[530],"\"odd":[536],"minor\".":[538],"describe":[542],"those":[546],"discuss":[557],"how":[558],"it.":[561],"needs":[564],"decomposition":[576],"H-minor-free":[579],"graphs.":[580],"deep":[585],"needed":[593],"correctness":[597],"their":[599]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2016-06-24T00:00:00"}