Online facility location against a t-bounded adversary

zbMATH Open1403.68362arXiv1711.09384MaRDI QIDQ4607948FDOQ4607948

Authors: Harry Lang 

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1711.09384

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

Mathematics Subject Classification ID

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

Cited In (1)

• Online facility location with mobile facilities

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)