Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons

Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos. Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, 2nd Workshop WADS 91, Ottawa, Canada, August 14-16, 1991, Proceedings. Volume 519 of Lecture Notes in Computer Science, pages 367-378, Springer, 1991.

@inproceedings{CarlssonNN91,
  title = {Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons},
  author = {Svante Carlsson and Bengt J. Nilsson and Simeon C. Ntafos},
  year = {1991},
  tags = {C++, routing},
  researchr = {https://researchr.org/publication/CarlssonNN91},
  cites = {0},
  citedby = {0},
  pages = {367-378},
  booktitle = {Algorithms and Data Structures, 2nd Workshop WADS  91, Ottawa, Canada, August 14-16, 1991, Proceedings},
  editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Nicola Santoro},
  volume = {519},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-54343-0},
}