An approximative solution to the Zookeeper's problem

DOI10.1016/S0020-0190(03)00348-XMaRDI QIDQ1014446zbMATH OpenFDO

Authors Håkan Jonsson

Publication date 28 April 2009

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

zbMATH Keywords

computational geometryshortest pathZookeeper's problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A 2-approximation algorithm for 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

• scientific article; zbMATH DE number 1049272 (Why is no real title available?)
• scientific article; zbMATH DE number 1796966 (Why is no real title available?)
• An O\((n\log n)\) algorithm for the zoo-keeper's problem
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Shortest zookeeper's routes in simple polygons
• The zookeeper route problem
• Triangulating a simple polygon in linear time

Cited in

(5)

• A 2-approximation algorithm for the zookeeper's problem
• Shortest zookeeper's routes in simple polygons
• An O\((n\log n)\) algorithm for the zoo-keeper's problem
• A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
• Approximation algorithms for the watchman route and zookeeper's problems.

This page was built for publication: An approximative solution to the Zookeeper's problem

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