Obtaining online approximation algorithms for facility dispersion from offline algorithms

DOI10.1002/net.20109zbMath1102.68724OpenAlexW4251533424MaRDI QIDQ5487808

S. S. Ravi, Giri Kumar Tayi, Daniel J. Rosenkrantz

Publication date: 12 September 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20109

zbMATH Keywords

competitive ratioonline algorithmapproximation ratiooffline algorithmfacility dispersion

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Related Items (3)

An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs ⋮ Unnamed Item ⋮ Efficient Approximations for the Online Dispersion Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• Reducing truth-telling online mechanisms to online optimization
• Algorithms and Data Structures

This page was built for publication: Obtaining online approximation algorithms for facility dispersion from offline algorithms