Pages that link to "Item:Q2661766"
From MaRDI portal
The following pages link to An approximation algorithm for general energy restricted sweep coverage problem (Q2661766):
Displaying 11 items.
- Time sensitive sweep coverage with minimum UAVs (Q2079882) (← links)
- 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)
- Approximation algorithm for sweep coverage on graph (Q2346569) (← 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)
- Energy-constrained geometric coverage problem (Q6167018) (← links)
- Algorithm for partial sweep coverage on a line (Q6633537) (← links)