The Aquarium Keeper's Problem

Authors:
Jurek Czyzowicz;Peter Egyed;Hazel Everett;David Rappaport;Thomas Shermer;Diane Souvaine;Godfried Toussaint;Jorge Urrutia
Affiliations:
Department d'Informatique, Université du Quebecà Hull, Hull, Quebec, Canada;School of Computer Science, McGill University, Montreal, Quebec, Canada H3S 2A7;School of Computer Science, McGill University, Montreal, Quebec, Canada H3S 2A7;Department of Computing and Information Science, Queen's, University, Kingston, Ontario, Canada K7L 3N6;School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6;Department of Computer Science, Rutgers University, New Brunswick, New Jersey;School of Computer Science, McGill University, Montreal, Quebec, Canada H3S 2A7;Department of Computer Science, University of Ottawa, Ottawa, Ontario, Canada K1N 6N5
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Optimum watchman routes

SCG '86 Proceedings of the second annual symposium on Computational geometry
On solving geometric optimization problems using shortest paths

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Triangulating Simple Polygons and Equivalent Problems

ACM Transactions on Graphics (TOG)

Finding shortest safari routes in simple polygons

Information Processing Letters
CORDS: status and directions

CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An approximate algorithm for solving the watchman route problem

RobVis'08 Proceedings of the 2nd international conference on Robot vision
Optimal patrolling of fragmented boundaries

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Hi-index	0.00