Pages that link to "Item:Q2729647"

The following pages link to Using Homogeneous Weights for Approximating the Partial Cover Problem (Q2729647):

Displaying 32 items.

• Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
• Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
• A unified approach to approximating partial covering problems (Q633845) (← links)
• Implicit branching and parameterized partial cover problems (Q657922) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• Partial multicuts in trees (Q861281) (← links)
• Approximation algorithms for maximum linear arrangement (Q1603380) (← links)
• A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
• Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
• Approximation algorithm for the multicovering problem (Q2025081) (← 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 algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
• Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
• Parallel approximation for partial set cover (Q2243336) (← links)
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
• A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← 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)
• 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)
• The Approximability of Partial Vertex Covers in Trees (Q2971146) (← links)
• Maximum Weighted Independent Sets with a Budget (Q2971655) (← links)
• Breaking the<i>r</i>_maxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
• Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← 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)
• Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
• On colorful vertex and edge cover problems (Q6088300) (← links)
• On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)