The Online Median Problem

Abstract

We introduce a natural variant of the (metric uncapacitated) k-median problem that we call the online median problem. Whereas the k-median problem involves optimizing the simultaneous placement of k facilities, the online median problem imposes the following additional constraints: the facilities are placed one at a time; a facility cannot be moved once it… (More)
DOI: 10.1109/SFCS.2000.892122

Topics

  • Presentations referencing similar topics