GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST

DOI10.1142/S0218195910003232zbMath1190.90046OpenAlexW2102172432MaRDI QIDQ3562851

Ramesh Krishnamurti, Pengpeng Wang, Kamal Gupta

Publication date: 28 May 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195910003232

zbMATH Keywords

approximation algorithmart gallery problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• An algorithm for shortest-path motion in three dimensions
• Optimum watchman routes
• The Euclidean traveling salesman problem is NP-complete
• Computing vision points in polygons
• Approximation algorithms for terrain guarding.
• The Discrete Geodesic Problem
• Determining approximate shortest paths on weighted polyhedral surfaces
• Computational complexity of art gallery problems
• How to learn an unknown environment. I
• Some NP-hard polygon decomposition problems
• Computational Geometry in C
• The weighted region problem
• The Robot Localization Problem
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• Exploring Unknown Environments
• On finding approximate optimal paths in weighted regions

This page was built for publication: GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST