Oblivious Medians Via Online Bidding (Extended Abstract)

@inproceedings{Chrobak2006ObliviousMV,
  title={Oblivious Medians Via Online Bidding (Extended Abstract)},
  author={Marek Chrobak and Claire Kenyon and John Noga and Neal E. Young},
  year={2006}
}
Following Mettu and Plaxton [22, 21], we study oblivious algorithms for the k-medians problem. Such an algorithm produces an incremental sequence of facility sets. We give improved algorithms, including a (24 + )-competitive deterministic polynomial algorithm and a 2e ≈ 5.44-competitive randomized non-polynomial algorithm. Our approach is similar to that of [18], which was done independently. We then consider the competitive ratio with respect to size. An algorithm is s-size-competitive if, for… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

Competitiveness via Doubling

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

SIGACT news online algorithms column 10: competitiveness via doubling

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Better bounds for incremental medians

  • Theor. Comput. Sci.
  • 2011
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Similar Papers

Loading similar papers…