Approximating a shortest watchman route
type: Item
instance of: scholarly article
zbMATH Open document ID: 0976.68166
author: Bengt J. Nilsson
publication date: 2001-04-24T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1590689
zbMATH Keywords: art gallery problems
zbMATH Keywords: visibility
zbMATH Keywords: watchman route
MaRDI profile type: Publication
Recommended article: Approximating Watchman Routes
Recommended article: AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
Recommended article: Concerning the time bounds of existing shortest watchman route algorithms
Recommended article: Theory and Applications of Models of Computation
Recommended article: Shortest watchman routes in simple polygons
Recommended article: An improved algorithm for computing a shortest watchman route for lines
Recommended article: Fast computation of shortest watchman routes in simple polygons
Recommended article: Finding the shortest watchman route in a simple polygon
Recommended article: Approximating Shortest Paths in Graphs
title: Approximating a shortest watchman route
published in: Fundamenta Informaticae
description: scientific article