An O (log k ) approximation algorithm for the k minimum spanning tree problem in the plane
Naveen Garg, Dorit S. Hochbaum · 1994
Article An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane Share on Authors: Naveen Garg Department of Computer Science and Engineering, Indian Institute of Technology, Delhi Department of Computer Science and Engineering, Indian Institute of Technology, DelhiView Profile , Dorit S. Hochbaum Industrial Engineering and Operations Research, University of California, Berkeley, CA Industrial Engineering and Operations Research, University of California, Berkeley, CAView Profile Authors Info & Claims STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of ComputingMay 1994 Pages 432–438https://doi.org/10.1145/195058.195218Online:23 May 1994Publication History 14citation425DownloadsMetricsTotal Citations14Total Downloads425Last 12 Months11Last 6 weeks0 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