@inproceedings{wang:hal-04022156,
  TITLE = {{An Approximation Algorithm for the k-Connected Location Set Cover Problem with Color-Spanning Constraint}},
  AUTHOR = {Wang, Yin and Xu, Yinfeng},
  URL = {https://inria.hal.science/hal-04022156},
  NOTE = {Part 5: Modern Scheduling and Applications in Industry 4.0},
  BOOKTITLE = {{IFIP International Conference on Advances in Production Management Systems (APMS)}},
  ADDRESS = {Nantes, France},
  EDITOR = {Alexandre Dolgui and Alain Bernard and David Lemoine and Gregor von Cieminski and David Romero},
  PUBLISHER = {{Springer International Publishing}},
  SERIES = {Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems},
  VOLUME = {AICT-632},
  NUMBER = {Part III},
  PAGES = {317-325},
  YEAR = {2021},
  MONTH = Sep,
  DOI = {10.1007/978-3-030-85906-0\_36},
  KEYWORDS = {Color-spanning set;Approximation algorithm;Maximum coverage problems;Farthest-Color Voronoi Diagram(FCVD);Minimum spanning tree},
  PDF = {https://inria.hal.science/hal-04022156/file/520759_1_En_36_Chapter.pdf},
  HAL_ID = {hal-04022156},
  HAL_VERSION = {v1},
}