Minimizing maximum cost in task coverage problem with multiple mobile sensors: A heuristic approach based on all-pairs shortest path.
Saved in:
| Title: | Minimizing maximum cost in task coverage problem with multiple mobile sensors: A heuristic approach based on all-pairs shortest path. |
|---|---|
| Authors: | Min, Hyeun Jeong1, Lim, Hyo-Sang1, hyosang@yonsei.ac.kr |
| Source: | International Journal of Distributed Sensor Networks; Nov2017, Vol. 13 Issue 11, p1-1, 1p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
