The k-Median Problem for Directed Trees

Abstract Marek Chrobak1 , Lawrence L. Larmore2 , and Wojciech Rytter3,4 1 Department of Computer Science, University of California Riverside, CA 92521 2 Department of Computer Science, University of Nevada Las Vegas, NV 89154-4019 3 Instytut Informatyki, Uniwersytet Warszawski Banacha 2, 02–097, Warszawa, Poland 4 Department of Computer Science, University of Liverpool Liverpool L69 7ZF, UK The k-median problem is a classical facility location problem. We consider the k-median problem for directed trees, motivated by the problem of locating proxies on the World Wide Web. The two main results of the paper are an O(n log n) time algorithm for k=2 and an O(n log2 n) time algorithm for k=3. The previously known upper bounds for these two cases were O(n2 ).

• Type: Conference
• Year: 2001
• Where: MFCS
• Authors: Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
• Keywords: Computer Science, Facility Location Problem, K-median Problem, MFCS 2001, Theoretical Computer Science