Author:
Blum Christian,Ehrgott Matthias
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference40 articles.
1. Local Search in Combinatorial Optimization;Aarts,1997
2. S. Arora, Polynomial time approximation algorithms for Euclidean TSP and other geometric problems, in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, IEEE Society Press, Los Alamitos, 1996, pp. 2–11.
3. B. Awerbuch, Y. Azar, A. Blum, S. Vempala, Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen, in: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1995, pp. 277–283.
4. B. Awerbuch, Y. Azar, A. Blum, S. Vempala, New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen, SIAM J. Comput. 28(1) (1998) 254–262.
5. A. Blum, P. Chalasani, A. Vempala, A constant-factor approximation for the k-MST problem in the plane, in: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1995, pp. 294–302.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献