Covering points in the plane by <i>k</i>-tours

Article Free Access Share on Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k Authors: Tetsuo Asano Dept. af Engr. Informatics, Osaka Electro-Communication University, Neyagawa 572, Japan Dept. af Engr. Informatics, Osaka Electro-Communication University, Neyagawa 572, JapanView Profile , Naoki Katoh Dept. of Management Science, Kobe university of Commerce, Kobe 651-21, Japan Dept. of Management Science, Kobe university of Commerce, Kobe 651-21, JapanView Profile , Hisao Tamaki IBM Tokyo Research Laboratory, Yamato 242, Japan IBM Tokyo Research Laboratory, Yamato 242, JapanView Profile , Takeshi Tokuyama IBM Tokyo Research Laboratory, Yamato 242, Japan IBM Tokyo Research Laboratory, Yamato 242, JapanView Profile Authors Info & Claims STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computingMay 1997 Pages 275–283https://doi.org/10.1145/258533.258602Online:04 May 1997Publication History 31citation606DownloadsMetricsTotal Citations31Total Downloads606Last 12 Months51Last 6 weeks14 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