Title: A constant-factor approximation algorithm for the <i>k</i> MST problem (extended abstract)
Abstract:Article Free Access Share on A constant-factor approximation algorithm for the k MST problem (extended abstract) Authors: Avrim Blum School of Computer Science, Carnegie Mellon University, Pittsburgh,...Article Free Access Share on A constant-factor approximation algorithm for the k MST problem (extended abstract) Authors: Avrim Blum School of Computer Science, Carnegie Mellon University, Pittsburgh, PA School of Computer Science, Carnegie Mellon University, Pittsburgh, PAView Profile , R. Ravi Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh PA Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh PAView Profile , Santosh Vempala School of Computer Science, Carnegie Mellon University, Pittsburgh, PA School of Computer Science, Carnegie Mellon University, Pittsburgh, PAView Profile Authors Info & Claims STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of ComputingJuly 1996 Pages 442–448https://doi.org/10.1145/237814.237992Online:01 July 1996Publication History 29citation579DownloadsMetricsTotal Citations29Total Downloads579Last 12 Months25Last 6 weeks1 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 SiteeReaderPDFRead More