Tight analysis of a self-approaching strategy for the online kernel-search problem

DOI10.1016/S0020-0190(98)00191-4zbMath1339.68275OpenAlexW2040771032MaRDI QIDQ294606

Jae-Ha Lee, Kyung-Yong Chwa

Publication date: 16 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001914?np=y

zbMATH Keywords

computational geometryonline algorithmstar-shaped polygon

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Online algorithms for searching and exploration in the plane ⋮ Searching and on-line recognition of star-shaped polygons. ⋮ Generalized self-approaching curves

Cites Work

• Unnamed Item
• Walking an unknown street with bounded detour
• Self-approaching curves
• Curves with increasing chords

This page was built for publication: Tight analysis of a self-approaching strategy for the online kernel-search problem