Pages that link to "Item:Q2391176"
From MaRDI portal
The following pages link to A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176):
Displaying 13 items.
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- Approximation algorithm for vertex cover with multiple covering constraints (Q2072095) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- Tight approximation for partial vertex cover with hard capacities (Q2420573) (← 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)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- Tight approximation for partial vertex cover with hard capacities (Q5136285) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
