Pages that link to "Item:Q2010112"

The following pages link to Approximation algorithm for the partial set multi-cover problem (Q2010112):

Displaying 21 items.

• A unified approach to approximating partial covering problems (Q633845) (← links)
• Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
• A fast approximation algorithm for the multicovering problem (Q1082267) (← links)
• A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
• Calculating approximation guarantees for partial set cover of pairs (Q1676481) (← links)
• Partial sublinear time approximation and inapproximation for maximum coverage (Q1791009) (← links)
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
• Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
• Approximation algorithms for the partial assignment problem (Q2197546) (← 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)
• Local ratio method on partial set multi-cover (Q2410050) (← links)
• Partial Interval Set Cover – Trade-Offs between Scalability and Optimality (Q2851852) (← links)
• A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
• (Q4535021) (← links)
• (Q4843442) (← 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)
• A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem (Q6049083) (← links)
• On approximating partial scenario set cover (Q6652422) (← links)