The following pages link to (Q4400849):
Displaying 19 items.
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Partial multicuts in trees (Q861281) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- Approximation algorithm for vertex cover with multiple covering constraints (Q2072095) (← 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)
- The Approximability of Partial Vertex Covers in Trees (Q2971146) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- (Q5091035) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- Improved Upper Bounds for Partial Vertex Cover (Q5302059) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- Approximation algorithms for minimum weight partial connected set cover problem (Q5963645) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
- Approximation algorithms for partial vertex covers in trees (Q6554733) (← links)
