Online facility location against a t-bounded adversary

MaRDI QIDQ4607948zbMATH OpenFDO

Authors Harry Lang

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1711.09384, http://dl.acm.org/citation.cfm?id=3175335

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Discrete location and assignment (90B80)

Recommendations

• On the competitive ratio for online facility location
• scientific article; zbMATH DE number 2038744
• The Online Median Problem
• Facility Location in Dynamic Geometric Data Streams
• A simple and deterministic competitive algorithm for online facility location

Cited in

(3)

• Online facility location with mobile facilities
• Unexpected effects of online no-substitution k-means clustering
• No-substitution k-means clustering with adversarial order

This page was built for publication: Online facility location against a \(t\)-bounded adversary

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