Pages that link to "Item:Q633845"

The following pages link to A unified approach to approximating partial covering problems (Q633845):

Displaying 25 items.

• Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
• Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
• A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
• Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
• Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
• Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
• Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
• Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
• A note on the minimum power partial cover problem on the plane (Q2165259) (← links)
• Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
• An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937) (← links)
• Parallel approximation for partial set cover (Q2243336) (← links)
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
• Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
• Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
• On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
• Approximation algorithm for the stochastic prize-collecting set multicover problem (Q2670509) (← links)
• An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689) (← links)
• On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← 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)
• (Q5091070) (← links)
• On Partial Covering For Geometric Set Systems (Q5115815) (← links)
• An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344) (← links)
• On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)