A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract)

Abstract

Article Free Access Share on A constant-factor approximation algorithm for the k-median problem (extended abstract) Authors: Moses Charikar Stanford University, Stanford, CA Stanford University, Stanford, CAView Profile , Sudipto Guha Stanford University, Stanford, CA Stanford University, Stanford, CAView Profile , Éva Tardos Cornell University, Ithaca, NY Cornell University, Ithaca, NYView Profile , David B. Shmoys Cornell University, Ithaca, NY Cornell University, Ithaca, NYView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999 Pages 1–10https://doi.org/10.1145/301250.301257Published:01 May 1999Publication History 170citation1,175DownloadsMetricsTotal Citations170Total Downloads1,175Last 12 Months198Last 6 weeks31 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF