Pages that link to "Item:Q2282997"
From MaRDI portal
The following pages link to A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997):
Displaying 4 items.
- 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)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
