Online chasing problems for regular polygons

DOI10.1016/j.ipl.2008.03.025zbMath1191.68895OpenAlexW2065883253MaRDI QIDQ975435

Kazuo Iwama, Hiroshi Fujiwara, Kouki Yonezawa

Publication date: 9 June 2010

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

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

zbMATH Keywords

competitive analysisanalysis of algorithmson-line algorithmsserver location problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Lipschitz selectors may not yield competitive algorithms for convex body chasing

Cites Work

• Unnamed Item
• Unnamed Item
• On convex body chasing
• The 3-server problem in the plane.
• The weighted 2-server problem
• The CNN problem and other \(k\)-server variants
• The orthogonal CNN problem
• Competitive algorithms for server problems
• The generalized two-server problem
• An optimal on-line algorithm for metrical task system
• Algorithms and Data Structures
• Algorithms for the on-line travelling salesman

This page was built for publication: Online chasing problems for regular polygons