A primal-dual algorithm for the minimum partial set multi-cover problem
From MaRDI portal
Recommendations
- Primal dual algorithm for partial set multi-cover
- Local ratio method on partial set multi-cover
- Approximation algorithm for the partial set multi-cover problem
- Approximation algorithm for partial set multicover versus full set multicover
- Approximation algorithm for minimum partial multi-cover under a geometric setting
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Analytical approach to parallel repetition
- Approximation algorithm for partial positive influence problem in social network
- Approximation algorithms for combinatorial problems
- Approximation algorithms for partial covering problems
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Automata, Languages and Programming
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3889282 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Improved performance of the greedy algorithm for partial cover
- Local ratio method on partial set multi-cover
- On positive influence dominating sets in social networks
- On the approximability of influence in social networks
- On the approximability of positive influence dominating set in social networks
- On the ratio of optimal integral and fractional covers
- Positive Influence Dominating Set in Online Social Networks
- Reducibility among combinatorial problems
- Using homogeneous weights for approximating the partial cover problem
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(21)- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
- A primal-dual algorithm for the minimum power partial cover problem
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- Parallel approximation for partial set cover
- Primal dual algorithm for partial set multi-cover
- Local ratio method on partial set multi-cover
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Minimum power partial multi-cover on a line
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties
- Online mixed ring covering problem with two nodes
- scientific article; zbMATH DE number 1138448 (Why is no real title available?)
- Approximation algorithm for partial set multicover versus full set multicover
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- An improved approximation algorithm for the k-prize-collecting minimum power cover problem
- An approximation algorithm for the H-prize-collecting power cover problem
- An approximation algorithm for the minimum soft capacitated disk multi-coverage problem
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem
- On generalizations of partial scenario set cover
- A 1/2-approximation algorithm for maximum interval multi-cover
- Approximation algorithm for the minimum interval partial multi-cover problem
This page was built for publication: A primal-dual algorithm for the minimum partial set multi-cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307495)
