Coverage with k-Transmitters in the Presence of Obstacles

DOI10.1007/978-3-642-17461-2_1zbMath1311.90116OpenAlexW2099898669MaRDI QIDQ3066439

Pat Morin, Mirela Damian, Anna Lubiw, Brad Ballinger, Prosenjit Bose, Diane L. Souvaine, Ryuhei Uehara, Nadia Benbernou, Vera Sacristán, Erik D. Demaine, Ferran Hurtado, John Iacono, Vida Dujmović, Robin Y. Flatland

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_1

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

\(k\)-Transmitter watchman routes ⋮ Combinatorics and complexity of guarding polygons with edge and point 2-transmitters ⋮ On \(k\)-convex polygons ⋮ Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon ⋮ Watchman routes for lines and line segments