Peihuang Huang, Wenxing Zhu, Longkun Guo. On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary. In T. V. Gopal, Junzo Watada, editors, Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings. Volume 11436 of Lecture Notes in Computer Science, pages 313-324, Springer, 2019. [doi]
@inproceedings{HuangZG19-0,
title = {On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary},
author = {Peihuang Huang and Wenxing Zhu and Longkun Guo},
year = {2019},
doi = {10.1007/978-3-030-14812-6_19},
url = {https://doi.org/10.1007/978-3-030-14812-6_19},
researchr = {https://researchr.org/publication/HuangZG19-0},
cites = {0},
citedby = {0},
pages = {313-324},
booktitle = {Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings},
editor = {T. V. Gopal and Junzo Watada},
volume = {11436},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-14812-6},
}