{"id":"https://openalex.org/W2963777460","doi":"https://doi.org/10.1145/3196834","title":"Hardness of Approximation for <i>H</i> -free Edge Modification Problems","display_name":"Hardness of Approximation for <i>H</i> -free Edge Modification Problems","publication_year":2018,"publication_date":"2018-05-06","ids":{"openalex":"https://openalex.org/W2963777460","doi":"https://doi.org/10.1145/3196834","mag":"2963777460"},"language":"en","primary_location":{"id":"doi:10.1145/3196834","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3196834","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","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/A5064783288","display_name":"Ivan Bliznets","orcid":"https://orcid.org/0000-0003-2291-2556"},"institutions":[{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Ivan Bliznets","raw_affiliation_strings":["St.\u00a0Petersburg Department of Steklov Institute of Mathematics, St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"St.\u00a0Petersburg Department of Steklov Institute of Mathematics, St. Petersburg, Russia","institution_ids":["https://openalex.org/I2800906181"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068064690","display_name":"Pawe\u0142 Komosa","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Komosa","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.206,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.5976783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":"2","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9961000084877014,"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.9941999912261963,"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.8075892925262451},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7699965834617615},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.7462590932846069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.674564003944397},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5134838223457336},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5038394331932068},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48068222403526306},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42305853962898254}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8075892925262451},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7699965834617615},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.7462590932846069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.674564003944397},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5134838223457336},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5038394331932068},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48068222403526306},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42305853962898254},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3196834","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3196834","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7723633313","display_name":null,"funder_award_id":"UMO-2013/11/D/ST6/03073","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1754878559","https://openalex.org/W1985572324","https://openalex.org/W1998552318","https://openalex.org/W2012067448","https://openalex.org/W2068190866","https://openalex.org/W2115674935","https://openalex.org/W2144050783","https://openalex.org/W2155453078","https://openalex.org/W2243582562","https://openalex.org/W2249739104","https://openalex.org/W2253699097","https://openalex.org/W2489053438","https://openalex.org/W2600350486","https://openalex.org/W2963260267"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W2425261484","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004"],"abstract_inverted_index":{"The":[0,44,64,206],"H":[1,34,39,45,110,121,141,152,163,171,222,231,245,272],"-":[2,46,164,172,232],"free":[3,47,165,173,233],"E":[4,48,166,174,234],"dge":[5,49,167,175,235],"D":[6,168,236,247],"eletion":[7,169,237,248],"problem":[8,52,69],"asks,":[9],"for":[10,106],"a":[11,224,274,277],"given":[12],"graph":[13,226],"G":[14,30],"and":[15,87,155,170,279],"integer":[16],"k":[17,27],",":[18,111],"whether":[19],"it":[20,33,91],"is":[21,53,153,223,238,252],"possible":[22],"to":[23,31,140,181,215,241,259],"delete":[24],"at":[25,157],"most":[26],"edges":[28,59],"from":[29,79],"make":[32],"-free\u2014that":[35],"is,":[36],"not":[37,98,185],"containing":[38],"as":[40],"an":[41,257,282],"induced":[42],"subgraph.":[43],"C":[50,176],"ompletion":[51,177],"defined":[54],"similarly,":[55],"but":[56],"we":[57,131,218,267,280],"add":[58],"instead":[60],"of":[61,66,76,82,84,120,136,208,211,271],"deleting":[62],"them.":[63],"study":[65,135],"these":[67],"two":[68,159,212],"families":[70],"has":[71,156],"recently":[72],"been":[73],"the":[74,80,95,118,133,201,209,242,269],"subject":[75],"intensive":[77],"studies":[78],"point":[81],"view":[83],"parameterized":[85,134],"complexity":[86,104],"kernelization.":[88],"In":[89,128],"particular,":[90],"was":[92],"shown":[93],"that":[94,150,220],"problems":[96,139],"do":[97,184],"admit":[99,186],"polynomial":[100,189],"kernels":[101],"(under":[102],"plausible":[103],"assumptions)":[105],"almost":[107,283],"all":[108],"graphs":[109,123,143],"with":[112],"several":[113],"important":[114],"exceptions":[115],"occurring":[116],"when":[117],"class":[119],"-free":[122,142],"exhibits":[124],"some":[125],"structural":[126],"properties.":[127],"this":[129],"work,":[130],"complement":[132],"edge":[137],"modification":[138],"by":[144],"considering":[145],"their":[146],"approximability.":[147],"We":[148],"prove":[149],"whenever":[151,221],"3-connected":[154,265],"least":[158],"nonedges,":[160],"then":[161,230],"both":[162],"are":[178],"very":[179],"hard":[180],"approximate:":[182],"they":[183],"poly(OPT)-approximation":[187],"in":[188,195,198,244,256],"time,":[190],"unless":[191,200],"P=NP,":[192],"or":[193,276],"even":[194],"time":[196,203],"subexponential":[197],"OPT,":[199],"exponential":[202],"hypothesis":[204],"fails.":[205],"assumption":[207],"existence":[210],"nonedges":[213],"appears":[214],"be":[216],"important:":[217],"show":[219],"complete":[225,284],"without":[227],"one":[228],"edge,":[229],"tightly":[239],"connected":[240],"M":[243],"orn":[246],"problem,":[249],"whose":[250],"approximability":[251],"still":[253],"open.":[254],"Finally,":[255],"attempt":[258],"extend":[260],"our":[261],"hardness":[262],"results":[263],"beyond":[264],"graphs,":[266],"consider":[268],"cases":[270],"being":[273],"path":[275],"cycle,":[278],"achieve":[281],"dichotomy":[285],"there.":[286]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}