最密集k子图问题的蚁群优化方法*

2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI:10.1109/SYNASC57785.2022.00039

Zoltán Tasnádi, Noémi Gaskó

{"title":"最密集k子图问题的蚁群优化方法*","authors":"Zoltán Tasnádi, Noémi Gaskó","doi":"10.1109/SYNASC57785.2022.00039","DOIUrl":null,"url":null,"abstract":"The densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach is proposed to solve this combinatorial optimisation problem. Numerical experiments show the effectiveness and potential of the proposed approach.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"191 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*\",\"authors\":\"Zoltán Tasnádi, Noémi Gaskó\",\"doi\":\"10.1109/SYNASC57785.2022.00039\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach is proposed to solve this combinatorial optimisation problem. Numerical experiments show the effectiveness and potential of the proposed approach.\",\"PeriodicalId\":446065,\"journal\":{\"name\":\"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"191 8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC57785.2022.00039\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC57785.2022.00039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

最密集k子图问题是众所周知的最大团问题的一个松弛，它包括找到一个恰好有k个节点和最大边数的子图。提出了一种基于蚁群优化的组合优化方法。数值实验证明了该方法的有效性和潜力。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*

The densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach is proposed to solve this combinatorial optimisation problem. Numerical experiments show the effectiveness and potential of the proposed approach.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

自引率

0.00%

发文量