Oblivious Medians Via Online Bidding

DOI10.1007/11682462_31zbMath1145.68583OpenAlexW1595388125MaRDI QIDQ3525769

Neal E. Young, John Noga, Marek Chrobak, Claire M. Kenyon

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_31

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Discrete location and assignment (90B80) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (7)

On hierarchical diameter-clustering and the supplier problem ⋮ Better bounds for incremental medians ⋮ An Optimal Incremental Algorithm for Minimizing Lateness with Rejection ⋮ An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem ⋮ Incremental medians via online bidding ⋮ Better Bounds for Incremental Medians ⋮ Guessing fractions of online sequences

This page was built for publication: Oblivious Medians Via Online Bidding