An approximation algorithm for the prize-collecting partial scenario set cover problem
- 25 October 2026
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 52 (4) , 43
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (12461061)
- Hebei Provincial Department of Science and Technology (246Z7605G)
- Hebei Normal University of Science and Technology (L2024J01)
This publication has 19 references indexed in Scilit:
- W-prize-collecting scheduling problem on parallel machinesJournal of Combinatorial Optimization, 2024
- A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penaltiesFrontiers of Computer Science, 2022
- Algorithms for covering multiple submodular constraints and applicationsJournal of Combinatorial Optimization, 2022
- An Approximation Algorithm for P-prize-collecting Set Cover ProblemJournal of the Operations Research Society of China, 2021
- Learning the set covering machine by bound minimization and margin-sparsity trade-offMachine Learning, 2009
- A Unified Approach to Approximating Partial Covering ProblemsAlgorithmica, 2009
- Using Homogeneous Weights for Approximating the Partial Cover ProblemJournal of Algorithms, 2001
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Reducibility among Combinatorial Problems1972