Obtaining online approximation algorithms for facility dispersion from offline algorithms

DOI10.1002/NET.20109zbMATH Open1102.68724OpenAlexW4251533424MaRDI QIDQ5487808FDOQ5487808

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Online algorithms. The state of the art
• Title not available (Why is that?)
• Reducing truth-telling online mechanisms to online optimization
• Algorithms and Data Structures

Cited In (3)

• Efficient Approximations for the Online Dispersion Problem
• Title not available (Why is that?)
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs

   Recommendations

• Efficient Approximations for the Online Dispersion Problem 👍 👎
• Efficient Approximations for the Online Dispersion Problem 👍 👎
• The Online Median Problem 👍 👎
• Approximation algorithms for dispersion problems 👍 👎
• Title not available (Why is that?) 👍 👎

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

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