A 2-approximation algorithm for the zookeeper's problem
type: Item
instance of: scholarly article
title: A 2-approximation algorithm for the zookeeper's problem
zbMATH Open document ID: 1185.68861
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5664713
zbMATH Keywords: computational geometry
zbMATH Keywords: approximation algorithms
zbMATH Keywords: zookeeper's problem
zbMATH Keywords: unfolding technique
author: Xuehou Tan
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.06.005
OpenAlex ID: W4234806859
cites work: An O\((n\log n)\) algorithm for the zoo-keeper's problem
cites work: Triangulating a simple polygon in linear time
cites work: Shortest watchman routes in simple polygons
cites work: The zookeeper route problem
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: An approximative solution to the Zookeeper's problem
cites work: Shortest zookeeper's routes in simple polygons
cites work: Fast computation of shortest watchman routes in simple polygons
cites work: Finding shortest safari routes in simple polygons
cites work: Approximation algorithms for the watchman route and zookeeper's problems.
DOI: 10.1016/J.IPL.2006.06.005
description: scientific article; zbMATH DE number 5664713