{"id":"https://openalex.org/W2803833216","doi":"https://doi.org/10.4149/cai_2018_2_385","title":"Analysis of Iterated Greedy Heuristic for Vertex Clique Covering","display_name":"Analysis of Iterated Greedy Heuristic for Vertex Clique Covering","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2803833216","doi":"https://doi.org/10.4149/cai_2018_2_385","mag":"2803833216"},"language":"en","primary_location":{"id":"doi:10.4149/cai_2018_2_385","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_2_385","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.4149/cai_2018_2_385","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103082796","display_name":"David Chalupa","orcid":"https://orcid.org/0000-0002-9248-377X"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"David Chalupa","raw_affiliation_strings":["Operations Research Group, Department of Materials and Production Aalborg University, Aalborg 9220"],"affiliations":[{"raw_affiliation_string":"Operations Research Group, Department of Materials and Production Aalborg University, Aalborg 9220","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028860119","display_name":"Ji\u0159\u0131\u0301 Posp\u0131\u0301chal","orcid":"https://orcid.org/0000-0002-2617-7184"},"institutions":[{"id":"https://openalex.org/I4210157357","display_name":"University of Ss. Cyril and Methodius in Trnava","ror":"https://ror.org/04xdyq509","country_code":"SK","type":"education","lineage":["https://openalex.org/I4210157357"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Posp\u00edchal","raw_affiliation_strings":["Faculty of Natural Sciences, University of SS. Cyril and Methodius, 917 01 Trnava"],"affiliations":[{"raw_affiliation_string":"Faculty of Natural Sciences, University of SS. Cyril and Methodius, 917 01 Trnava","institution_ids":["https://openalex.org/I4210157357"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103082796"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":0.3097,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67960958,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"37","issue":"2","first_page":"385","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9718999862670898,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9546999931335449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6816411018371582},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6139318346977234},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5676129460334778},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5355937480926514},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5152947902679443},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5074374079704285},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49686315655708313},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4921409487724304},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.43829208612442017},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.43153083324432373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42675432562828064},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.41404736042022705},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35515305399894714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35269543528556824},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.28163808584213257},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.08811527490615845}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6816411018371582},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6139318346977234},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5676129460334778},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5355937480926514},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5152947902679443},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5074374079704285},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49686315655708313},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4921409487724304},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.43829208612442017},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.43153083324432373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42675432562828064},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.41404736042022705},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35515305399894714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35269543528556824},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.28163808584213257},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.08811527490615845},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4149/cai_2018_2_385","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_2_385","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4149/cai_2018_2_385","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_2_385","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W133641357","https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1547915777","https://openalex.org/W1559893718","https://openalex.org/W1572923654","https://openalex.org/W1825587999","https://openalex.org/W1968481794","https://openalex.org/W1970025632","https://openalex.org/W1971421925","https://openalex.org/W1997367770","https://openalex.org/W2007259126","https://openalex.org/W2008620264","https://openalex.org/W2030435589","https://openalex.org/W2040081895","https://openalex.org/W2052468331","https://openalex.org/W2076513440","https://openalex.org/W2088415500","https://openalex.org/W2100137329","https://openalex.org/W2108301529","https://openalex.org/W2146591355","https://openalex.org/W2153401898","https://openalex.org/W2153663865","https://openalex.org/W2156184725","https://openalex.org/W2157816158","https://openalex.org/W2200005621","https://openalex.org/W2232368126","https://openalex.org/W2343876716","https://openalex.org/W2401610261","https://openalex.org/W2461017545","https://openalex.org/W2753919984","https://openalex.org/W2963098446","https://openalex.org/W2997776631","https://openalex.org/W3110051778","https://openalex.org/W4242712865"],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W2383239740","https://openalex.org/W1796509207","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464","https://openalex.org/W4285171291","https://openalex.org/W2162082186","https://openalex.org/W2951533720"],"abstract_inverted_index":{"The":[0],"aim":[1],"of":[2,14,50,96,110,121,151],"the":[3,12,25,48,88,119,159],"vertex":[4],"clique":[5],"covering":[6],"problem":[7],"(CCP)":[8],"is":[9,45,114],"to":[10,36,59,158],"cover":[11],"vertices":[13],"a":[15,93,115,147],"graph":[16],"with":[17,104,163],"as":[18,21],"few":[19],"cliques":[20],"possible.":[22],"We":[23,68],"analyse":[24],"iterated":[26],"greedy":[27],"(IG)":[28],"algorithm":[29],"for":[30,41,52,71,90,161],"CCP,":[31],"which":[32,113,153],"was":[33],"previously":[34],"shown":[35],"provide":[37],"strong":[38],"empirical":[39],"results":[40,65],"real-world":[42],"networks.":[43],"It":[44],"demonstrated":[46],"how":[47],"techniques":[49],"analysis":[51],"randomised":[53],"search":[54],"heuristics":[55],"can":[56],"be":[57],"applied":[58],"IG,":[60,152],"and":[61],"several":[62],"practically":[63],"relevant":[64],"are":[66],"obtained.":[67],"show":[69,84],"that":[70,85,129],"triangle-free":[72],"graphs,":[73],"IG":[74,86,130],"solves":[75],"CCP":[76,91],"optimally":[77],"in":[78,92,100,136,139],"expected":[79,101,155],"polynomial":[80,102,137],"time.":[81],"Secondly,":[82],"we":[83,127,145],"finds":[87],"optimum":[89,160],"specific":[94],"case":[95],"sparse":[97],"random":[98],"graphs":[99,162],"time":[103,138],"high":[105],"probability.":[106],"For":[107],"Barab\u00e1si-Albert":[108],"model":[109,117],"scale-free":[111],"networks,":[112,126],"canonical":[116],"explaining":[118],"growth":[120],"social,":[122],"biological":[123],"or":[124],"computer":[125],"obtain":[128],"obtains":[131],"an":[132],"asymptotically":[133],"optimal":[134],"approximation":[135],"expectation.":[140],"Last":[141],"but":[142],"not":[143],"least,":[144],"propose":[146],"slightly":[148],"modified":[149],"variant":[150],"guarantees":[154],"polynomial-time":[156],"convergence":[157],"non-overlapping":[164],"triangles.":[165]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}