Funder
Council of Scientific & Industrial Research (CSIR), Government of IndiaCouncil of Scientific & Industrial Research (CSIR), Government of India
Science and Engineering Research Board (SERB), Government of IndiaScience and Engineering Research Board (SERB), Government of India
Reference26 articles.
1. The generalized covering traveling salesman problem;Shaelaie;Appl. Soft Comput.,2014
2. New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen;Awerbuch;SIAM J. Comput.,1998
3. A constant-factor approximation algorithm for the k mst problem;Blum,1996
4. A 3-approximation for the minimum tree spanning k vertices;Garg,1996
5. On the linear description of the k-cycle polytope;Nguyen;Int. Trans. Oper. Res.,2001
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献