Pages that link to "Item:Q2424716"
From MaRDI portal
The following pages link to Approximation algorithms for distance constraint sweep coverage with base stations (Q2424716):
Displaying 8 items.
- Constant-approximation for prize-collecting min-sensor sweep coverage with base stations (Q2151357) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← 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 distance constraint sweep coverage without predetermined base stations (Q4554549) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
- Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints (Q6606172) (← links)
- Algorithm for partial sweep coverage on a line (Q6633537) (← links)
