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

DOI10.1016/S0020-0190(98)00191-4zbMATH Open1339.68275OpenAlexW2040771032MaRDI QIDQ294606FDOQ294606

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1617273
• Searching and on-line recognition of star-shaped polygons.
• Position-independent near optimal searching and on-line recognition in star polygons
• Competitive Online Approximation of the Optimal Search Ratio
• Algorithms – ESA 2004

zbMATH Keywords

computational geometryonline algorithmstar-shaped polygon

Mathematics Subject Classification ID

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

Cites Work

• Walking an unknown street with bounded detour
• Self-approaching curves
• Curves with increasing chords
• Title not available (Why is that?)

Cited In (3)

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

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

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