Min, H. J., & Lim, H. (2017). Minimizing maximum cost in task coverage problem with multiple mobile sensors: A heuristic approach based on all-pairs shortest path. International Journal of Distributed Sensor Networks, 13(11), 1. https://doi.org/10.1177/1550147717741265
Chicago Style (17th ed.) CitationMin, Hyeun Jeong, and Hyo-Sang Lim. "Minimizing Maximum Cost in Task Coverage Problem with Multiple Mobile Sensors: A Heuristic Approach Based on All-pairs Shortest Path." International Journal of Distributed Sensor Networks 13, no. 11 (2017): 1. https://doi.org/10.1177/1550147717741265.
MLA (9th ed.) CitationMin, Hyeun Jeong, and Hyo-Sang Lim. "Minimizing Maximum Cost in Task Coverage Problem with Multiple Mobile Sensors: A Heuristic Approach Based on All-pairs Shortest Path." International Journal of Distributed Sensor Networks, vol. 13, no. 11, 2017, p. 1, https://doi.org/10.1177/1550147717741265.