Several works recently focus on monitoring air quality of critical areas using sensors attached to buses. They aim to monitor the maximum number of critical areas using a limited number of sensors. In practice, we may want to have information for all critical areas. We work on the problem of covering all the areas using the minimum number of sensors in this work. We show that, even when the bus routes are not pre-defined, the problem is NP-hard and is significantly harder than the problem of the previous works. Then, we develop two algorithms for the case that the routes are pre-defined. Those algorithms include a fixed parameter tractability and a 2-approximation algorithm for a special case of the problem. Our experiment results show that, although we usually give the similar number of sensors as the algorithm in the previous works, our algorithms have a shorter computation time than the classical greedy algorithm.
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes
01.09.2022
493161 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Computation of Minimum-Time Vessel Ocean Routes Using Genetic Algorithms
British Library Conference Proceedings | 2003
|Disaster Region Coverage Using Drones: Maximum Area Coverage and Minimum Resource Utilisation
DOAJ | 2022
|Designers target short vehicle ferry routes
Online Contents | 1996
SYSTEMS, DEVICES, AND METHODS FOR GENERATING VEHICLE ROUTES WITHIN SIGNAL COVERAGE ZONES
Europäisches Patentamt | 2019
|