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

Full description

Saved in:

Bibliographic Details
Published in:	Frontiers of Computer Science Vol. 17; no. 3; p. 173404
Main Authors:	LIU, Xiaofei, LI, Weidong, YANG, Jinhua
Format:	Journal Article
Language:	English
Published:	Beijing Higher Education Press 01.06.2023 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!