Approximation algorithms for partial covering problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Computing small partial coverings
- Calculating approximation guarantees for partial set cover of pairs
- A simple approximation algorithm for minimum weight partial connected set cover
- On combinatorial approximation of covering 0-1 integer programs and partial set cover
- Partial sublinear time approximation and inapproximation for maximum coverage
- Subexponential algorithms for partial cover problems
- Maximum subset intersection
- A 6/5-approximation algorithm for the maximum 3-cover problem
- On approximation of the submodular set cover problem
- One for the price of two: a unified approach for approximating covering problems
- Lift \& project systems performing on the partial-vertex-cover polytope
- Approximation algorithm for the partial set multi-cover problem
- Approximation algorithm for the multicovering problem
- Approximation algorithm for stochastic set cover problem
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- Approximation algorithm for vertex cover with multiple covering constraints
- A primal-dual algorithm for the minimum power partial cover problem
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- Parallel algorithm for minimum partial dominating set in unit disk graph
- Algorithms for covering multiple submodular constraints and applications
- Approximation algorithms for the partial assignment problem
- Iterative partial rounding for vertex cover with hard capacities
- Parallel approximation for partial set cover
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
- An approximation algorithm for the partial covering 0-1 integer program
- A primal-dual algorithm for the minimum partial set multi-cover problem
- Set cover problems with small neighborhood covers
- The most points connected-covering problem with two disks
- Approximation algorithms for the covering-type \(k\)-violation linear program
- Geometric red-blue set cover for unit squares and related problems
- Approximation algorithm for sweep coverage on graph
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
- Capacitated Arc Stabbing
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- Tight approximation bounds for combinatorial frugal coverage algorithms
- Local ratio method on partial set multi-cover
- Randomized approximation for the set multicover problem in hypergraphs
- Minimum power partial multi-cover on a line
- 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
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives
- Using homogeneous weights for approximating the partial cover problem
- Approximating subdense instances of covering problems
- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality
- An algorithmic framework for solving geometric covering problems -- with applications
- Improved performance of the greedy algorithm for partial cover
- The approximability of partial vertex covers in trees
- Maximum weighted independent sets with a budget
- Implicit branching and parameterized partial cover problems (extended abstract)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
- Approximation Algorithms for Edge-Covering Problem
- An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
- Thresholded covering algorithms for robust and max-min optimization
- 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 1182761 (Why is no real title available?)
- scientific article; zbMATH DE number 1947055 (Why is no real title available?)
- scientific article; zbMATH DE number 1754596 (Why is no real title available?)
- On the inapproximability of maximum intersection problems
- Approximation algorithm for partial set multicover versus full set multicover
- Approximation Algorithms for the k-Clique Covering Problem
- Lagrangian relaxation and partial cover (Extended abstract)
- Approximation algorithms for the partition vertex cover problem
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- Constant-approximation for minimum weight partial sensor cover
- 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
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Approximating partially bounded degree deletion on directed graphs
- Improved Upper Bounds for Partial Vertex Cover
- Partial vertex cover and budgeted maximum coverage in bipartite graphs
- Approximation Algorithms for Barrier Sweep Coverage
- A Unified Approach to Approximating Partial Covering Problems
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Approximation algorithms for some minimum postmen cover problems
- An approximation algorithm for the partial vertex cover problem in hypergraphs
- On colorful vertex and edge cover problems
- An exact procedure and LP formulations for the leader-follower location problem
- Polynomial time approximation schemes for minimum disk 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
- On approximating partial scenario set cover
- Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints
- Hybrid k-clustering: blending k-median and k-center
- On generalizations of partial scenario set cover
- Mixed graph covering with target constraints
- Finding smallest witnesses for conjunctive queries
- Efficient algorithms for the conditional covering problem
- Hybrid k-clustering: blending k-median and k-center
- An improved approximation algorithm for the most points covering problem
- Parameterized lower bounds for the weighted vertex cover problem in trees
- Approximation algorithm for prize-collecting weighted set cover with fairness constraints
- An approximation algorithm for the k-prize-collecting hitting set problem
This page was built for publication: Approximation algorithms for partial covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4826763)
