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 条

[41] Statistical physics of hard combinatorial optimization:Vertex cover problem
赵金华
周海军
Chinese Physics B, 2014, (07) : 118 - 124
[42] Asymmetric Game: A Silver Bullet to Weighted Vertex Cover of Networks
Tang, Changbing
Li, Ang
Li, Xiang
IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (10) : 2994 - 3005
[43] Game-Based Memetic Algorithm to the Vertex Cover of Networks
Wu, Jianshe
Shen, Xing
Jiao, Kui
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (03) : 974 - 988
[44] Framing Effect in Vertex Cover of Networks Under Prospect Theory
Chen, Jie
Zhan, Changlei
Xu, Ke
Zhou, Rongpei
IEEE SYSTEMS JOURNAL, 2024, 18 (02): : 1092 - 1103
[45] Optimal vertex cover for the small-world Hanoi networks
Boettcher, Stefan
Hartmann, Alexander K.
PHYSICAL REVIEW E, 2011, 84 (01)
[46] Modeling the communication problem in wireless sensor networks as a vertex cover
Safar, Maytham
Taha, Mohammad
Habib, Sami
2007 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1 AND 2, 2007, : 592 - +
[47] Adaptive Vertex Cover of Dynamical Networks With Prospect Theoretic Perspective
Li, Xiang
Chen, Jie
Yuan, Quan
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2022, 9 (06): : 4159 - 4170
[48] On the cover. Neural networks. An overview
Jansson, Peter A.
Analytical Chemistry, 1991, 63 (06)
[49] Experimental analysis of approximation algorithms for the vertex cover and set covering problems
Gomes, Fernando C.
Meneses, Claudio N.
Pardalos, Panos M.
Viana, Gerardo Valdisio R.
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3520 - 3534
[50] Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover
Liu, Yunlong
Li, Yixuan
Huang, Jingui
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024, 35 (06) : 609 - 629

← 1 2 3 4 5 →