On finding a guard that sees most and a shop that sells most

O. Cheong, A. Eifrat, S. Har-Peled

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

20 Citations (Scopus)
Original languageEnglish
Title of host publicationProceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004, New Orleans LA, USA, January 11-14, 2004)
EditorsJ.I. Munro
Place of PublicationPhiladelphia
PublisherSociety for Industrial and Applied Mathematics (SIAM)
Pages1098-1107
DOIs
Publication statusPublished - 2004

Cite this

Cheong, O., Eifrat, A., & Har-Peled, S. (2004). On finding a guard that sees most and a shop that sells most. In J. I. Munro (Ed.), Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004, New Orleans LA, USA, January 11-14, 2004) (pp. 1098-1107). Philadelphia: Society for Industrial and Applied Mathematics (SIAM). https://doi.org/10.1145/982954