The following pages link to (Q4411285):
Displayed 11 items.
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← 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)
- The Approximability of Partial Vertex Covers in Trees (Q2971146) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Improved Upper Bounds for Partial Vertex Cover (Q5302059) (← links)
- Approximation algorithms for minimum weight partial connected set cover problem (Q5963645) (← links)
- An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655) (← links)