Pages that link to "Item:Q4826763"
From MaRDI portal
The following pages link to Approximation algorithms for partial covering problems (Q4826763):
Displayed 25 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)
- 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)
- 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)
- AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- Improved Upper Bounds for Partial Vertex Cover (Q5302059) (← links)
- An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655) (← links)