Vertex Cover of Networks and Its Related Optimization Problems: An Overview

被引：0

作者：

Chen, Jie ^{[1
]}

Zhou, Rongpei ^{[2
]}

Wu, Jie ^{[3
]}

Zhang, Hui ^{[4
]}

Gui, Weihua ^{[5
]}

机构：

[1] Natl Univ Def Technol, Coll Elect Engn, Hefei 230037, Peoples R China

[2] Nanchang Univ, Sch Informat Engn, Nanchang 330036, Peoples R China

[3] Jiangnan Univ, Sch Artificial Intelligence & Comp Sci, Wuxi 214122, Peoples R China

[4] Anhui Med Univ, Sch Biomed Engn, Hefei 230032, Peoples R China

[5] Cent South Univ, Sch Automat, Changsha 410083, Peoples R China

来源：

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS | 2024年

基金：

中国国家自然科学基金;

关键词：

Centralized optimization; connected vertex cover; distributed optimization; & ell; -path vertex cover; vertex cover; weighted vertex cover; IMPROVED APPROXIMATION ALGORITHM; FIXED-PARAMETER ALGORITHMS; LOCAL SEARCH; EVOLUTIONARY ALGORITHMS; INDEPENDENT SET; P-3; PROBLEM; INTERNET; SYSTEMS; COMPLEXITY; ALLOCATION;

D O I：

10.1109/TNNLS.2024.3495836

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

As a well-known NP-hard problem, the vertex cover problem has broad applications, which has aroused the concern of many researchers. In recent years, its related optimization problems, including the weighted vertex cover problem, the & ell; >= 3 path vertex cover problem, and the connected vertex cover problem, and other related optimization problems have came into the view of researchers, who have designed various optimization algorithms to solve those related optimization problems. First, based on the existing works, we give detailed descriptions of the vertex cover problem and its related optimization problems and then review the current research progress. Then, we present some main representative optimization algorithms and provide numerical results and corresponding analysis. Finally, we summarize the existing works and present the future research directions.

引用

页数：21

共 50 条

[31] Solving Min Vertex Cover with iterated Mopfield networks
Bertoni, A
Campadelli, P
Grossi, G
NEURAL NETS WIRN VIETRI-01, 2002, : 87 - 95
[32] Fast Distributed Approximation Algorithms for Vertex Cover and Set Cover in Anonymous Networks
Astrand, Matti
Suomela, Jukka
SPAA '10: PROCEEDINGS OF THE TWENTY-SECOND ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2010, : 294 - 302
[33] Parameterized complexity of coloring problems: Treewidth versus vertex cover
Fiala, Jiri
Golovach, Petr A.
Kratochvil, Jan
THEORETICAL COMPUTER SCIENCE, 2011, 412 (23) : 2513 - 2523
[34] Approximation algorithms to minimum vertex cover problems on polygons and terrains
Tomás, AP
Bajuelos, AL
Marques, F
COMPUTATIONAL SCIENCE - ICCS 2003, PT I, PROCEEDINGS, 2003, 2657 : 869 - 878
[35] Solving large Minimum Vertex Cover problems on a quantum annealer
Pelofske, Elijah
Hahn, Georg
Djidjev, Hristo
CF '19 - PROCEEDINGS OF THE 16TH ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS, 2019, : 76 - 84
[36] Approximate Algorithms for Vertex Cover Problems in WSN Topology Design
Liu, Yuanchao
Fan, Jianxi
Wang, Dajin
Du, Hongwei
Zhang, Shukui
Lv, Jing
AD HOC & SENSOR WIRELESS NETWORKS, 2015, 28 (1-2) : 19 - 39
[37] Extension and its price for the connected vertex cover problem
Ghadikolaei, Mehdi Khosravian
Melissinos, Nikolaos
Monnot, Jerome
Pagourtzis, Aris
THEORETICAL COMPUTER SCIENCE, 2022, 904 : 66 - 80
[38] Extension and Its Price for the Connected Vertex Cover Problem
Ghadikoalei, Mehdi Khosravian
Melissinos, Nikolaos
Monnot, Jerome
Pagourtzis, Aris
COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 315 - 326
[39] Statistical physics of hard combinatorial optimization: Vertex cover problem
Zhao Jin-Hua
Zhou Hai-Jun
CHINESE PHYSICS B, 2014, 23 (07)
[40] Vertex Cover Optimization Using a Novel Graph Decomposition Approach
Manan, Abdul
Bashir, Shahida
Majid, Abdul
CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 73 (01): : 701 - 717

← 1 2 3 4 5 →