Dartmouth logo Dartmouth College Computer Science
Technical Report series
CS home
TR home
TR search TR listserv
By author: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
By number: 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986

Greedy Approximation Algorithms for K-Medians by Randomized Rounding
Neal E. Young
Dartmouth PCS-TR99-344


We give an improved approximation algorithm for the general k-medians problem. Given any \epsilon>0, the algorithm finds a solution of total distance at most D(1+\epsilon) using at most k ln(n+n/\epsilon) medians (a.k.a. sites), provided some solution of total distance D using k medians exists. This improves over the best previous bound (w.r.t. the number of medians) by a factor of \Omega(1/\epsilon) provided 1/\epsilon=n^O(1). The algorithm is a greedy algorithm, derived using the method of oblivious randomized rounding. It requires at most k ln(n+n/\epsilon) linear-time iterations. We also derive algorithms for fractional and weighted variants of the problem.

PS.Z compressed postscript .ps.Z (144KB) , PDF PDF (340KB) (derived from the ps.Z)

Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]

Or copy and paste:
   Neal E. Young, "Greedy Approximation Algorithms for K-Medians by Randomized Rounding." Dartmouth Computer Science Technical Report PCS-TR99-344, March 1999.

Notify me about new tech reports.

Search the technical reports.

To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu

Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Technical reports collection maintained by David Kotz.