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

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!