Approximation algorithm for the minimum interval partial multi-cover problem
From MaRDI portal
Cites work
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
- A primal-dual algorithm for the minimum partial set multi-cover problem
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- Approximation algorithm for partial positive influence problem in social network
- Approximation algorithm for the partial set multi-cover problem
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Everywhere-sparse spanners via dense subgraphs
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Local ratio method on partial set multi-cover
- Minimizing the union: tight approximations for small set bipartite vertex expansion
- Optimal coverage in wireless sensor networks
- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality
- PTAS for Densest k-Subgraph in Interval Graphs
- The dense \(k\)-subgraph problem
Cited in
(3)
This page was built for publication: Approximation algorithm for the minimum interval partial multi-cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012858)
