Pages that link to "Item:Q2410050"
From MaRDI portal
The following pages link to Local ratio method on partial set multi-cover (Q2410050):
Displaying 12 items.
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← 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)
- On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts (Q2215062) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- An approximation algorithm for the partial covering 0-1 integer program (Q2297657) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
- Approximation algorithm for partial set multicover versus full set multicover (Q4634530) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344) (← links)
