Vertex Cover of Networks and Its Related Optimization Problems: An Overview
Abstract:
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 \geq 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.
Related Concept Videos
Network Function of a Circuit
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Theorems of Pappus and Guldinus: Problem Solving
Circuit Terminology
A circuit, on the other hand, is also an interconnected system of electrical elements but must contain one or more closed paths.
Castigliano's Theorem: Problem Solving
Norton's Theorem


