Fining k points with minimum spanning trees and related problems
Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri · 1989
Article Free Access Share on Fining k points with minimum spanning trees and related problems Authors: A. Aggarwal IBM T. J. Watson Research Center IBM T. J. Watson Research CenterView Profile , H. Imai Kyushu University, Japan Kyushu University, JapanView Profile , N. Katoh Kobe University of Commerce, Japan Kobe University of Commerce, JapanView Profile , S. Suri Bell Communications Research Bell Communications ResearchView Profile Authors Info & Claims SCG '89: Proceedings of the fifth annual symposium on Computational geometryJune 1989 Pages 283–291https://doi.org/10.1145/73833.73865Published:05 June 1989Publication History 7citation660DownloadsMetricsTotal Citations7Total Downloads660Last 12 Months14Last 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF