Pages that link to "Item:Q4826763"
From MaRDI portal
The following pages link to Approximation algorithms for partial covering problems (Q4826763):
Displayed 50 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- An exact procedure and LP formulations for the leader-follower location problem (Q611000) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Partial multicuts in trees (Q861281) (← links)
- Multiple voting location problems (Q933517) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Maximum subset intersection (Q1944892) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Approximation algorithm for the multicovering problem (Q2025081) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- Approximation algorithm for vertex cover with multiple covering constraints (Q2072095) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- An approximation algorithm for the partial covering 0-1 integer program (Q2297657) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- The most points connected-covering problem with two disks (Q2322704) (← links)
- Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
- Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639) (← links)
- The Approximability of Partial Vertex Covers in Trees (Q2971146) (← links)
- Maximum Weighted Independent Sets with a Budget (Q2971655) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)