Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala. Improved approximation guarantees for minimum-weight ::::k::::-trees and prize-collecting salesmen. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 277-283, ACM, 1995. [doi]
Abstract is missing.