A Serial Game Distributed Algorithm to ϵ-Minimum Vertex Cover of Networks in Finite Time

Vertex cover problem is a typical nondeterministic polynomial combinatorial optimization problem with wide applications. In order to seek a near-optimal solution in finite time, this article achieves the goal from the perspective of serial potential game optimization. Specifically, we present the ve...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automation science and engineering Vol. 22; pp. 1534 - 1542
Main Authors: Chen, Jie, Zhou, Rongpei, Gui, Weihua
Format: Journal Article
Language:English
Published: IEEE 2025
Subjects:
Cameras
distributed algorithm
Distributed algorithms
finite time
Games
Monitoring
serial game
standard benchmark
Stochastic processes
Urban areas
ϵ-minimum vertex cover
ISSN:1545-5955, 1558-3783
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Vertex cover problem is a typical nondeterministic polynomial combinatorial optimization problem with wide applications. In order to seek a near-optimal solution in finite time, this article achieves the goal from the perspective of serial potential game optimization. Specifically, we present the vertex cover problem as a potential game, where the corresponding potential function minimizers are equivalent to the minimum vertex cover state. Then, we propose a novel polynomial-based serial game distributed algorithm, and prove that the algorithm can guarantee that strategies of all vertices converge to a <inline-formula> <tex-math notation="LaTeX">\epsilon </tex-math></inline-formula>-minimum vertex cover (<inline-formula> <tex-math notation="LaTeX">\epsilon </tex-math></inline-formula>-MVC) state in finite time. Compared with the existing representative optimization algorithms on networks and standard benchmarks, numerical simulations demonstrate our proposed algorithm can effectively balance solution efficiency and computation time. We hope this work provides insight for decision-makers designing a reasonable algorithm when solving nondeterministic polynomial optimization problems, so as to guarantee both solution quality and computation time. Note to Practitioners-Vertex cover problem has a wide range of practical applications. Many distributed optimization algorithms for the vertex cover problem are available in the existing literatures. However, those algorithms mainly pursue high-quality solutions in infinite time. Thus, one of the main challenges is to design a distributed algorithm that guarantees both solution quality and computation time. This article design a polynomial-based serial game algorithm, and prove that it can converge to the <inline-formula> <tex-math notation="LaTeX">\epsilon </tex-math></inline-formula>-MVC state in finite time. This article can serve as a supplement to the existing optimization algorithms for solving the vertex cover problem.
ISSN:1545-5955
1558-3783
DOI:10.1109/TASE.2024.3367722