Pages that link to "Item:Q2346569"
From MaRDI portal
The following pages link to Approximation algorithm for sweep coverage on graph (Q2346569):
Displayed 8 items.
- Constant-approximation for prize-collecting min-sensor sweep coverage with base stations (Q2151357) (← links)
- Approximation algorithm for prize-collecting sweep cover with base stations (Q2166725) (← links)
- Group sweep coverage with guaranteed approximation ratio (Q2193266) (← links)
- Solving energy issues for sweep coverage in wireless sensor networks (Q2357168) (← links)
- Approximation algorithms for distance constraint sweep coverage with base stations (Q2424716) (← links)
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations (Q4554549) (← links)
- Approximation Algorithms for Barrier Sweep Coverage (Q5384125) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)