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 条

[21] The vertex cover game: Application to transport networks
Gusev, Vasily V.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2020, 97
[22] A note on approximation of the vertex cover and feedback vertex set problems - Unified approach
Fujito, T
INFORMATION PROCESSING LETTERS, 1996, 59 (02) : 59 - 63
[23] A note on approximation of the vertex cover and feedback vertex set problems - Unified approach
Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi, Hiroshima 739, Japan
Inf. Process. Lett., 2 (59-63):
[24] Approximation of MAX INDEPENDENT SET, MIN VERTEX COVER and related problems by moderately exponential algorithms
Bourgeois, Nicolas
Escoffier, Bruno
Paschos, Vangelis Th.
DISCRETE APPLIED MATHEMATICS, 2011, 159 (17) : 1954 - 1970
[25] APPROXIMATION ALGORITHMS FOR THE SET COVERING AND VERTEX COVER PROBLEMS
HOCHBAUM, DS
SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 555 - 556
[26] New Hybrid Genetic Algorithm for Vertex Cover Problems
Huo Hongwei & Xu Jin1. School of Computer Science
2. Department of Control Science and Engineering
Journal of Systems Engineering and Electronics, 2003, (04) : 90 - 94
[27] Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Bansal, Nikhil
Khot, Subhash
AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2010, 6198 : 250 - +
[28] Generalized vertex cover using chemical reaction optimization
Islam, Md. Rafiqul
Arif, Imran Hossain
Shuvo, Rifat Hasan
APPLIED INTELLIGENCE, 2019, 49 (07) : 2546 - 2566
[29] Generalized vertex cover using chemical reaction optimization
Md. Rafiqul Islam
Imran Hossain Arif
Rifat Hasan Shuvo
Applied Intelligence, 2019, 49 : 2546 - 2566
[30] Prospect Theoretic Analysis on Weighted Vertex Cover of Networks
Hu, Yuanyuan
Chen, Jie
Tang, Changbing
2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 758 - 763

← 1 2 3 4 5 →