Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
Covering Problems and Core Percolations on Hypergraphs.
Bruno Coelho Coutinho ... Hai-Jun Zhou
Physical review letters | VOL. 124
Bruno Coelho Coutinho, et. al.Bruno Coelho Coutinho ... Hai-Jun Zhou
17 Jun 2020
English
...
-
, et. al. ...
01 Jan 2009
Molecular Solution to Minimum Vertex Cover Problem Using Surface-based DNA Computation
Kee-Rong Wu ... Chung-Wei Yeh
-
Kee-Rong Wu, et. al.Kee-Rong Wu ... Chung-Wei Yeh
01 Apr 2009
Vertex Cover Optimization Using a Novel Graph Decomposition Approach
Abdul Majid ... Abdul Manan
Computers, Materials & Continua | VOL. 73
Abdul Majid, et. al.Abdul Majid ... Abdul Manan
01 Jan 2021
View more papers

More From: Frontiers of Computer Science

Paper Title
Journal
Date
Author
I know I don’t know: an evidential deep learning framework for traffic classification
Shangsen Li ... Xiang Xu
Frontiers of Computer Science | VOL. -
Shangsen Li, et. al.Shangsen Li ... Xiang Xu
01 May 2024
Tissue-like P systems with polarizations
Yueguo Luo ... Ping Guo
Frontiers of Computer Science | VOL. 18
Yueguo Luo, et. al.Yueguo Luo ... Ping Guo
27 Apr 2024
Structure attack on full-round DBST
Ting Wu ... Qing Ling
Frontiers of Computer Science | VOL. 18
Ting Wu, et. al.Ting Wu ... Qing Ling
16 Apr 2024
A comprehensive framework for predicting public opinion by tracking multi-informational dynamics
Mingtao Sun ... Yan Wei
Frontiers of Computer Science | VOL. 18
Mingtao Sun, et. al.Mingtao Sun ... Yan Wei
08 Apr 2024
View more papers