Algorithms Column Samir Khulle r Department of Computer Science University of Maryland, College Park, MD 20742 samir@cs .umd .ed u Copyright © Samir Khuller, 200 1 This column will discuss recent developments in the field of algorithms . I expect that the results reported here will be from recent conferences or workshops . This column could b e useful to the reader who may not keep track of new developments in the field of algorithms . Guest columns on special topics will also be welcomed . Two problems that have received a lot of attention during the last few years are th e problems of Facility Location and the related problem of k-Medians . I will describe the problems, provide a brief summary of prior work, and then describe one of the main result s from a paper [1] to appear at STOC 2001 to be held in Crete, Greece . ¢ Facility Location: In the uncapacitated facility location (UFL) problem there is a set F of possible facility locations and a set C of clients . There is a metric eji that specifies the distance from client j E C to location i E F . Opening
/lp/association-for-computing-machinery/algorithms-column-0CyMald008