{"id":"https://openalex.org/W2007508589","doi":"https://doi.org/10.1137/09074944x","title":"Approximating Maximum Subgraphs without Short Cycles","display_name":"Approximating Maximum Subgraphs without Short Cycles","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2007508589","doi":"https://doi.org/10.1137/09074944x","mag":"2007508589"},"language":"en","primary_location":{"id":"doi:10.1137/09074944x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/09074944x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["guyk@camden.rutgers.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"guyk@camden.rutgers.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011741113","display_name":"Michael Langberg","orcid":"https://orcid.org/0000-0002-7470-0718"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Langberg","raw_affiliation_strings":["mikel@openu.ac.il and nutov@openu.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"mikel@openu.ac.il and nutov@openu.ac.il#TAB#","institution_ids":[]}]},{"author_position":"last","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":["The Open University of Israel"],"affiliations":[{"raw_affiliation_string":"The Open University of Israel","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056370891"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3769,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.80627823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"1","first_page":"255","last_page":"269"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.8137044906616211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7585541009902954},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6955959796905518},{"id":"https://openalex.org/keywords/transversal","display_name":"Transversal (combinatorics)","score":0.5667029023170471},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5543696284294128},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5380195379257202},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5349245071411133},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.43090516328811646},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38095664978027344},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.14596295356750488},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10860860347747803},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.06204679608345032}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8137044906616211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7585541009902954},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6955959796905518},{"id":"https://openalex.org/C2780130068","wikidata":"https://www.wikidata.org/wiki/Q2208651","display_name":"Transversal (combinatorics)","level":2,"score":0.5667029023170471},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5543696284294128},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5380195379257202},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5349245071411133},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.43090516328811646},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38095664978027344},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14596295356750488},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10860860347747803},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.06204679608345032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"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.1137/09074944x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/09074944x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W7570721","https://openalex.org/W1488677252","https://openalex.org/W1582742149","https://openalex.org/W1967066104","https://openalex.org/W1969037852","https://openalex.org/W1982728575","https://openalex.org/W1985123706","https://openalex.org/W1987996179","https://openalex.org/W1994460648","https://openalex.org/W2028340927","https://openalex.org/W2051660589","https://openalex.org/W2052325621","https://openalex.org/W2064600658","https://openalex.org/W2068871408","https://openalex.org/W2080600916","https://openalex.org/W2086306774","https://openalex.org/W2099809434","https://openalex.org/W2101644337","https://openalex.org/W2146652681","https://openalex.org/W2147779969","https://openalex.org/W2182211929","https://openalex.org/W2528403005","https://openalex.org/W2610585117","https://openalex.org/W2613420730","https://openalex.org/W4210755957","https://openalex.org/W4246647751"],"related_works":["https://openalex.org/W2271112932","https://openalex.org/W2772332644","https://openalex.org/W1969626693","https://openalex.org/W4251387394","https://openalex.org/W2897654805","https://openalex.org/W3144250209","https://openalex.org/W2147954430","https://openalex.org/W2031552172","https://openalex.org/W2622090745","https://openalex.org/W2583782779"],"abstract_inverted_index":{"We":[0,162,228],"study":[1],"approximation":[2,9],"algorithms,":[3],"integrality":[4,211,239],"gaps,":[5],"and":[6,35],"hardness":[7],"of":[8,10,16,31,50,67,83,102,206,213,226,236,275,278,289],"two":[11],"problems":[12,29],"related":[13],"to":[14,44,61,130,173],"cycles":[15,277,288],"\u201csmall\u201d":[17],"length":[18,279,290],"k":[19,176,189],"in":[20,104,223],"a":[21,32,46,63,168,234,252,284],"given":[22],"(undirected)":[23],"graph.":[24,106],"The":[25,39,56,139],"instance":[26],"for":[27,75,123,136,182,187,194,272],"these":[28],"consists":[30],"graph":[33,119],"$G=(V,E)$":[34],"an":[36,90,158,192,220],"integer":[37],"k.":[38,84,138],"k-Cycle":[40,165,249],"Transversal":[41,141,166,250],"problem":[42,59,79,142,222,231,274],"is":[43,60,74,99,127,135,266],"find":[45,62],"minimum":[47],"edge":[48,65],"subset":[49,66],"E":[51,68],"that":[52,113,164,179,247],"intersects":[53],"every":[54],"k-cycle.":[55],"k-Cycle-Free":[57,77,195],"Subgraph":[58,78,196],"maximum":[64,285],"without":[69,287],"k-cycles.":[70],"Our":[71,132],"main":[72],"result":[73,134,178],"the":[76,100,105,110,125,177,203,210,214,224,258,263,273],"with":[80,93,197,238,294],"even":[81],"values":[82],"For":[85,208],"any":[86,174],"$k=2r$,":[87],"we":[88,190,245],"give":[89,191],"$\\Omega(n^{-\\frac{1}{r}+\\frac{1}{r(2r-1)}-\\varepsilon})$-approximation":[91],"scheme":[92],"running":[94],"time":[95],"$(1/\\varepsilon)^{O(1/\\varepsilon)}\\mathsf{poly}(n)$,":[96],"where":[97],"$n=|V|$":[98],"number":[101],"vertices":[103],"This":[107],"improves":[108,201],"upon":[109,202],"ratio":[111,198,205,264],"$\\Omega(n^{-1/r})$":[112],"can":[114],"be":[115],"deduced":[116],"from":[117,128],"extremal":[118],"theory.":[120],"In":[121,243],"particular,":[122],"$k=4$":[124],"improvement":[126],"$\\Omega(n^{-1/2})$":[129],"$\\Omega(n^{-1/3-\\varepsilon})$.":[131],"additional":[133],"odd":[137,175,188],"3-Cycle":[140],"(covering":[143],"all":[144],"triangles)":[145],"was":[146,217],"studied":[147],"by":[148,232],"Krivelevich":[149,180],"[Discrete":[150],"Math.,":[151],"142":[152],"(1995),":[153],"pp.":[154],"281\u2013286],":[155],"who":[156],"presented":[157],"LP-based":[159],"2-approximation":[160],"algorithm.":[161],"show":[163,246],"admits":[167,251],"$(k-1)$-approximation":[169],"algorithm,":[170,254],"which":[171],"extends":[172],"proved":[181],"$k=3$.":[183],"Based":[184],"on":[185],"this,":[186],"algorithm":[193],"$\\frac{k-1}{2k-3}=\\frac{1}{2}+\\frac{1}{4k-6}$;":[199],"this":[200,230],"trivial":[204],"$1/2$.":[207],"$k=3$,":[209],"gap":[212,240],"underlying":[215],"LP":[216],"posed":[218],"as":[219],"open":[221],"work":[225],"Krivelevich.":[227],"resolve":[229],"showing":[233],"sequence":[235],"graphs":[237],"approaching":[241],"2.":[242],"addition,":[244],"if":[248],"$(2-\\varepsilon)$-approximation":[253],"then":[255],"so":[256],"does":[257],"Vertex-Cover":[259],"problem;":[260],"thus":[261],"improving":[262],"2":[265],"unlikely.":[267],"Similar":[268],"results":[269],"are":[270],"shown":[271],"covering":[276],"$\\leq":[280,291],"k$":[281,292],"or":[282],"finding":[283],"subgraph":[286],"(i.e.,":[293],"girth":[295],"$>k$).":[296]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}