{"id":"https://openalex.org/W2060363698","doi":"https://doi.org/10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","display_name":"Approximation algorithms and hardness results for cycle packing problems","publication_year":2007,"publication_date":"2007-11-01","ids":{"openalex":"https://openalex.org/W2060363698","doi":"https://doi.org/10.1145/1290672.1290685","mag":"2060363698"},"language":"en","primary_location":{"id":"doi:10.1145/1290672.1290685","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1290672.1290685","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5008556299","display_name":"Michael Krivelevich","orcid":"https://orcid.org/0000-0003-2357-4982"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Krivelevich","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003622145","display_name":"Zeev Nutov","orcid":"https://orcid.org/0000-0002-6629-3243"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Zeev Nutov","raw_affiliation_strings":["Open University of Israel, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Open University of Israel, Tel Aviv, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohammad R. Salavatipour","raw_affiliation_strings":["University of Alberta, Edmonton, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024446850","display_name":"Jacques Verstra\u00ebte","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jacques Verstraete","raw_affiliation_strings":["University of Waterloo, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Raphael Yuster","raw_affiliation_strings":["University of Haifa, Haifa, Israel",", University of Haifa, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":", University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6821,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.92913547,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"3","issue":"4","first_page":"48","last_page":"48"},"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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9990000128746033,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7761311531066895},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7748903036117554},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7232266068458557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.721102237701416},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6185239553451538},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5930977463722229},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5180647373199463},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5142950415611267},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.42559635639190674},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4158840477466583},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41238734126091003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3815622627735138}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7761311531066895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7748903036117554},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7232266068458557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.721102237701416},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6185239553451538},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5930977463722229},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5180647373199463},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5142950415611267},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.42559635639190674},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4158840477466583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41238734126091003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3815622627735138},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1290672.1290685","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1290672.1290685","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.116.9359","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.9359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ucsd.edu/~jverstra/dcig.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.131.4875","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.4875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ualberta.ca/~mreza/research/cycle-j.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.403.6524","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.6524","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.openu.ac.il/home/nutov/cycle packing.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W7570721","https://openalex.org/W1486704708","https://openalex.org/W1510730180","https://openalex.org/W1512015032","https://openalex.org/W1964448775","https://openalex.org/W1966838648","https://openalex.org/W1970259241","https://openalex.org/W1987001420","https://openalex.org/W1990800802","https://openalex.org/W2002540991","https://openalex.org/W2011764853","https://openalex.org/W2018732791","https://openalex.org/W2019578639","https://openalex.org/W2034269606","https://openalex.org/W2040831377","https://openalex.org/W2050122992","https://openalex.org/W2058821164","https://openalex.org/W2059920516","https://openalex.org/W2070745908","https://openalex.org/W2091737416","https://openalex.org/W2098361906","https://openalex.org/W2140262267","https://openalex.org/W2148352980","https://openalex.org/W2154571828","https://openalex.org/W2163963758","https://openalex.org/W4389615669","https://openalex.org/W6684073700"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2963158951","https://openalex.org/W2070751425","https://openalex.org/W1995738188"],"abstract_inverted_index":{"The":[0],"cycle":[1,216],"packing":[2],"number":[3,16,134],"\u03bd":[4,25,40,190,227],"e":[5,26,41,191,228],"(":[6,27,42,85,122,192,229],"G":[7,12,22,28,43,86,193,230],")":[8,29,44,96,194,209,231,242],"of":[9,17,59,103,130,135,144,150,171,174,189,204,214,235],"a":[10,57,112,132,140,201,233],"graph":[11],"is":[13,30,223],"the":[14,52,60,91,100,107,128,157,168,184,211,252],"maximum":[15,133],"pairwise":[18],"edge-disjoint":[19,136,215],"cycles":[20,137],"in":[21,45,162,195],".":[23],"Computing":[24],"an":[31,120],"NP-hard":[32],"problem.":[33,259],"We":[34,146,218],"present":[35,111],"approximation":[36,75,101,154],"algorithms":[37],"for":[38,99,127,183,210,243,257],"computing":[39],"both":[46],"undirected":[47,53],"and":[48,70,187],"directed":[49,108,196],"graphs.":[50,197],"In":[51,106,177],"case":[54,109],"we":[55,110,118,179,199],"analyze":[56],"variant":[58],"modified":[61],"greedy":[62],"algorithm":[63,126],"suggested":[64],"by":[65],"Caprara":[66],"et":[67],"al.":[68],"[2003]":[69],"show":[71,220],"that":[72,138,221],"it":[73,222],"has":[74],"ratio":[76,102],"\u0398(\u221alog":[77],"n":[78,81,95,114,123,206,208,241],"),":[79],"where":[80],"=":[82],"|":[83],"V":[84],")|.":[87],"This":[88,249],"improves":[89,250],"upon":[90,251],"previous":[92],"O":[93,121,236],"(log":[94,237],"upper":[97,165],"bound":[98,203],"this":[104,258],"algorithm.":[105,116],"\u221a":[113],"-approximation":[115],"Finally,":[117],"give":[119,180],"2/3":[124],")-approximation":[125],"problem":[129],"finding":[131],"intersect":[139],"specified":[141],"subset":[142],"S":[143],"vertices.":[145],"also":[147,219],"study":[148],"generalizations":[149],"these":[151,175],"problems.":[152,176],"Our":[153],"ratios":[155],"are":[156],"currently":[158],"best-known":[159],"ones":[160],"and,":[161],"addition,":[163,178],"provide":[164],"bounds":[166,182],"on":[167],"integrality":[169,185,212],"gap":[170,186,213],"standard":[172],"LP-relaxations":[173],"lower":[181,202],"approximability":[188],"Specifically,":[198],"prove":[200],"\u03a9(log":[205],"/loglog":[207],"packing.":[217],"quasi-NP-hard":[224],"to":[225],"approximate":[226],"within":[232],"factor":[234],"1":[238],"\u2212":[239],"\u03b5":[240,246],"any":[244],"constant":[245],">":[247],"0.":[248],"previously":[253],"known":[254],"APX-hardness":[255],"result":[256]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":8}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}