A 2-approximation algorithm for the zookeeper's problem

DOI10.1016/J.IPL.2006.06.005MaRDI QIDQ845863zbMATH OpenOpenAlexFDO

Authors Xuehou Tan

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.06.005

zbMATH Keywords

computational geometryapproximation algorithmsunfolding techniquezookeeper's problem

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• An approximative solution to the Zookeeper's problem
• Shortest zookeeper's routes in simple polygons
• scientific article; zbMATH DE number 1796966
• The zookeeper route problem
• Approximation algorithms for the watchman route and zookeeper's problems.

Cites work

• An O\((n\log n)\) algorithm for the zoo-keeper's problem
• An approximative solution to the Zookeeper's problem
• Approximation algorithms for the watchman route and zookeeper's problems.
• Fast computation of shortest watchman routes in simple polygons
• Finding shortest safari routes in simple polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Shortest watchman routes in simple polygons
• Shortest zookeeper's routes in simple polygons
• The zookeeper route problem
• Triangulating a simple polygon in linear time

Cited in

(6)

• An approximative solution to the Zookeeper's problem
• Shortest zookeeper's routes in simple polygons
• scientific article; zbMATH DE number 140109 (Why is no real title available?)
• scientific article; zbMATH DE number 1796966 (Why is no real title available?)
• Approximation algorithms for the watchman route and zookeeper's problems.
• The zookeeper route problem

This page was built for publication: A 2-approximation algorithm for the zookeeper's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845863)