{"id":"https://openalex.org/W3042827292","doi":"https://doi.org/10.1007/s10107-021-01744-w","title":"A tight approximation algorithm for the cluster vertex deletion problem","display_name":"A tight approximation algorithm for the cluster vertex deletion problem","publication_year":2022,"publication_date":"2022-01-07","ids":{"openalex":"https://openalex.org/W3042827292","doi":"https://doi.org/10.1007/s10107-021-01744-w","mag":"3042827292"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-021-01744-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-021-01744-w","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.monash.edu/en/publications/c9ef5737-29f1-4a3a-8299-a7fba18abddc","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071692531","display_name":"Manuel Aprile","orcid":"https://orcid.org/0000-0002-6805-6903"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Manuel Aprile","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 degli Studi di Padova, Padua, Italy"],"raw_orcid":"https://orcid.org/0000-0002-6805-6903","affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Padova, Padua, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078228812","display_name":"Matthew Drescher","orcid":null},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Matthew Drescher","raw_affiliation_strings":["D\u00e9partement de Math\u00e9matique, Universit\u00e9 libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement de Math\u00e9matique, Universit\u00e9 libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001781037","display_name":"Samuel Fiorini","orcid":"https://orcid.org/0000-0002-6845-9008"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Samuel Fiorini","raw_affiliation_strings":["D\u00e9partement de Math\u00e9matique, Universit\u00e9 libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement de Math\u00e9matique, Universit\u00e9 libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007554852","display_name":"Tony Huynh","orcid":"https://orcid.org/0000-0002-6908-923X"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Tony Huynh","raw_affiliation_strings":["School of Mathematics, Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071692531"],"corresponding_institution_ids":["https://openalex.org/I138689650"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.1414,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.78153054,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"197","issue":"2","first_page":"1069","last_page":"1091"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12149","display_name":"Nanocluster Synthesis and Applications","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.743901789188385},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7168875932693481},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7093088626861572},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6209136843681335},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6022922992706299},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4585663080215454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45632293820381165},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4280596971511841},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42090895771980286},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4124568700790405},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37741386890411377},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32550108432769775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11557501554489136}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.743901789188385},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7168875932693481},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7093088626861572},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6209136843681335},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6022922992706299},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4585663080215454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45632293820381165},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4280596971511841},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42090895771980286},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4124568700790405},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37741386890411377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32550108432769775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11557501554489136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-021-01744-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-021-01744-w","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:monash.edu:publications/c9ef5737-29f1-4a3a-8299-a7fba18abddc","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/c9ef5737-29f1-4a3a-8299-a7fba18abddc","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aprile , M , Drescher , M , Fiorini , S & Huynh , T 2021 , A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem . in M Singh & D P Williamson (eds) , Integer Programming and Combinatorial Optimization : 22nd International Conference, IPCO 2021, Proceedings . vol. 12707 , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 12707 LNCS , Springer , Cham Switzerland , pp. 340-353 , International Conference on Integer Programming and Combinatorial Optimization , Virtual, Online , 19/05/21 . https://doi.org/10.1007/978-3-030-73879-2_24","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:iris.uniroma1.it:11573/1705869","is_oa":false,"landing_page_url":"https://hdl.handle.net/11573/1705869","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:www.research.unipd.it:11577/3421198","is_oa":true,"landing_page_url":"https://hdl.handle.net/11577/3421198","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:monash.edu:publications/c9ef5737-29f1-4a3a-8299-a7fba18abddc","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/c9ef5737-29f1-4a3a-8299-a7fba18abddc","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aprile , M , Drescher , M , Fiorini , S & Huynh , T 2021 , A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem . in M Singh & D P Williamson (eds) , Integer Programming and Combinatorial Optimization : 22nd International Conference, IPCO 2021, Proceedings . vol. 12707 , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 12707 LNCS , Springer , Cham Switzerland , pp. 340-353 , International Conference on Integer Programming and Combinatorial Optimization , Virtual, Online , 19/05/21 . https://doi.org/10.1007/978-3-030-73879-2_24","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4429578927","display_name":null,"funder_award_id":"T008720F-35293308-BD-OCP.","funder_id":"https://openalex.org/F4320321390","funder_display_name":"Fonds De La Recherche Scientifique - FNRS"},{"id":"https://openalex.org/G7626641170","display_name":null,"funder_award_id":"615640-ForEFront","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1899379166","https://openalex.org/W1963547452","https://openalex.org/W1991477862","https://openalex.org/W2001878420","https://openalex.org/W2024023966","https://openalex.org/W2049143039","https://openalex.org/W2065769502","https://openalex.org/W2068871408","https://openalex.org/W2077397558","https://openalex.org/W2077658979","https://openalex.org/W2086119402","https://openalex.org/W2088180270","https://openalex.org/W2113280143","https://openalex.org/W2118348286","https://openalex.org/W2156747735","https://openalex.org/W2461238324","https://openalex.org/W2529974411","https://openalex.org/W2592683100","https://openalex.org/W2611804663","https://openalex.org/W2777065051","https://openalex.org/W2803257030","https://openalex.org/W2888663778","https://openalex.org/W2912385276","https://openalex.org/W2921791163","https://openalex.org/W2941863476","https://openalex.org/W2953247680","https://openalex.org/W2962933009","https://openalex.org/W2963010019","https://openalex.org/W2963617229","https://openalex.org/W2964176371","https://openalex.org/W2997601075","https://openalex.org/W3090142643","https://openalex.org/W3101793140","https://openalex.org/W3103071483","https://openalex.org/W3107834779","https://openalex.org/W3119976028","https://openalex.org/W3136561472","https://openalex.org/W3138640113","https://openalex.org/W3162862852","https://openalex.org/W3176604045","https://openalex.org/W4210308458","https://openalex.org/W4213255380","https://openalex.org/W4238156242","https://openalex.org/W4285719527","https://openalex.org/W4300568640"],"related_works":["https://openalex.org/W2079263399","https://openalex.org/W4221167366","https://openalex.org/W1560183925","https://openalex.org/W4226211922","https://openalex.org/W2024517697","https://openalex.org/W2056597184","https://openalex.org/W2079730540","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2125212169"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}