Pages that link to "Item:Q2672626"
From MaRDI portal
The following pages link to Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626):
Displaying 8 items.
- On minimum submodular cover with submodular cost (Q540698) (← links)
- Greedy approximations for minimum submodular cover with submodular cost (Q2379694) (← links)
- Min-Power Covering Problems (Q3459876) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344) (← links)
- Energy-constrained geometric coverage problem (Q6167018) (← links)
- An approximation algorithm for the minimum soft capacitated disk multi-coverage problem (Q6535281) (← links)
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem (Q6535282) (← links)