A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties

In this paper, we consider the k -prize-collecting minimum vertex cover problem with submodular penalties, which generalizes the well-known minimum vertex cover problem, minimum partial vertex cover problem and minimum vertex cover problem with submodular penalties. We are given a cost graph G = ( V...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Frontiers of Computer Science Ročník 17; číslo 3; s. 173404
Hlavní autori:	LIU, Xiaofei, LI, Weidong, YANG, Jinhua
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Beijing Higher Education Press 01.06.2023 Springer Nature B.V
Predmet:	Algorithms Apexes Approximation approximation algorithm Combinatorial analysis Computer Science Cost function Graph theory k-prize-collecting Mathematical analysis primal-dual Research Article vertex cover Vertex sets approximation algorithm vertex cover prize-collecting primal-dual
ISSN:	2095-2228, 2095-2236
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!