Author:
Ausiello G.,Demange M.,Laura L.,Paschos V.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference19 articles.
1. A 2.5-factor approximation algorithm for the k-mst problem;Arya;Inform. Process. Lett.,1998
2. On-line dial-a-ride problems: minimizing the completion time;Ascheuer,2000
3. Algorithms for the on-line travelling salesman;Ausiello;Algorithmica,1998
4. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen;Awerbuch,1995
5. New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen;Awerbuch;SIAM J. Comput.,1998
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献