Key points are not available for this paper at this time.
Article Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median Share on Authors: Moses Charikar Computer Science Department, Stanford University Computer Science Department, Stanford UniversityView Profile , Chandra Chekuri Computer Science Department, Stanford University Computer Science Department, Stanford UniversityView Profile , Ashish Goel Computer Science Department, Stanford University Computer Science Department, Stanford UniversityView Profile , Sudipto Guha Computer Science Department, Stanford University Computer Science Department, Stanford UniversityView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 114–123https://doi.org/10.1145/276698.276719Online:23 May 1998Publication History 96citation795DownloadsMetricsTotal Citations96Total Downloads795Last 12 Months33Last 6 weeks4 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 SiteGet Access
Charikar et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: