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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on automation science and engineering Ročník 22; s. 1534 - 1542
Hlavní autori:	Chen, Jie, Zhou, Rongpei, Gui, Weihua
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!