Using homogeneous weights for approximating the partial cover problem
From MaRDI portal
Recommendations
Cited in
(49)- Computing small partial coverings
- Approximation algorithms for maximum linear arrangement
- A simple approximation algorithm for minimum weight partial connected set cover
- Approximation algorithm for the partial set multi-cover problem
- Approximation algorithm for the multicovering problem
- Approximation algorithm for vertex cover with multiple covering constraints
- A primal-dual algorithm for the minimum power partial cover problem
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- Algorithms for covering multiple submodular constraints and applications
- Parallel approximation for partial set cover
- 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
- Assigning weights to minimize the covering radius in the plane
- Capacitated Arc Stabbing
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- Local ratio method on partial set multi-cover
- Randomized approximation for the set multicover problem in hypergraphs
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
- An approximation algorithm for \(P\)-prize-collecting set cover problem
- The approximability of partial vertex covers in trees
- Maximum weighted independent sets with a budget
- Partial multicovering and the d-consecutive ones property
- scientific article; zbMATH DE number 1305393 (Why is no real title available?)
- scientific article; zbMATH DE number 709680 (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
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
- Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
- Approximation algorithm for vertex cover with multiple covering constraints
- On partial covering for geometric set systems
- Approximating partially bounded degree deletion on directed graphs
- Partial vertex cover and budgeted maximum coverage in bipartite graphs
- Approximation algorithms for minimum weight partial connected set cover problem
- Approximating power node-deletion problems
- On colorful vertex and edge cover problems
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
- A unified approach to approximating partial covering problems
- Approximation algorithms for partial vertex covers in trees
- Implicit branching and parameterized partial cover problems
- Approximating power node-deletion problems
- On approximating partial scenario set cover
- Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints
- Mixed graph covering with target constraints
- Parameterized lower bounds for the weighted vertex cover problem in trees
- Minimum-cost mixed graph covers with targeted weight constraints
- Learn to optimize from structured samples for minimum partial set cover
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
- Partial multicuts in trees
This page was built for publication: Using homogeneous weights for approximating the partial cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729647)
