A 1/2-approximation algorithm for maximum interval multi-cover
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- scientific article; zbMATH DE number 7788517 (Why is no real title available?)
- A primal-dual algorithm for the minimum partial set multi-cover problem
- A threshold of ln n for approximating set cover
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- An analysis of approximations for maximizing submodular set functions—I
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- Approximation algorithm for the minimum interval partial multi-cover problem
- Approximation algorithm for the partial set multi-cover problem
- Approximation algorithms for NP-hard problems.
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- Local ratio method on partial set multi-cover
- New variations of the maximum coverage facility location problem
- PTAS for densest \(k\)-subgraph in interval graphs
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- The budgeted maximum coverage problem
- Tight approximation bounds for maximum multi-coverage
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
This page was built for publication: A 1/2-approximation algorithm for maximum interval multi-cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956047)
