Online chasing problems for regular polygons

DOI10.1016/J.IPL.2008.03.025zbMATH Open1191.68895OpenAlexW2065883253MaRDI QIDQ975435FDOQ975435

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

Recommendations

• A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle
• Competitive algorithms for server problems
• The 3-server problem in the plane.
• A competitive 2-server algorithm
• The generalized two-server problem

zbMATH Keywords

analysis of algorithmscompetitive analysison-line algorithmsserver location problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Lipschitz selectors may not yield competitive algorithms for convex body chasing

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

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