A recursive greedy algorithm for walks in directed graphs
暂无分享,去创建一个
[1] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[2] A. Meyer. Review: Walter J. Savitch, Relationships between Nondeterministic and Deterministic Tape Complexities , 1974 .
[3] Alan M. Frieze,et al. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.
[4] R. Vohra,et al. The Orienteering Problem , 1987 .
[5] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[6] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[7] John N. Tsitsiklis,et al. Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.
[8] Giri Narasimhan,et al. Resource-constrained geometric network optimization , 1998, SCG '98.
[9] R. Ravi,et al. A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.
[10] Sudipto Guha,et al. Approximation algorithms for directed Steiner problems , 1999, SODA '98.
[11] Sanjeev Arora,et al. A 2+epsilon approximation algorithm for the k-MST problem , 2000, SODA.
[12] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2000, STOC '00.
[13] Sanjeev Arora,et al. A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.
[14] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[15] A. Zelikovsky,et al. An improved approximation scheme for the Group Steiner Problem , 2001 .
[16] Alex Zelikovsky,et al. An improved approximation scheme for the Group Steiner Problem , 2001, Networks.
[17] Aravind Srinivasan,et al. Approximation algorithms for the covering Steiner problem , 2002, Random Struct. Algorithms.
[18] Guy Kortsarz,et al. On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem , 2002, SWAT.
[19] Aravind Srinivasan,et al. Integrality ratio for group Steiner trees and directed steiner trees , 2003, SODA '03.
[20] Robert Krauthgamer,et al. Polylogarithmic inapproximability , 2003, STOC '03.
[21] David R. Karger,et al. Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[22] Aravind Srinivasan,et al. On the Covering Steiner Problem , 2003, FSTTCS.
[23] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[24] Adam Meyerson,et al. Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.
[25] Amit Kumar,et al. Maximum Coverage Problem with Group Budget Constraints and Applications , 2004, APPROX-RANDOM.
[26] Moshe Lewenstein,et al. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.
[27] Naveen Garg,et al. Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.
[28] Reuven Bar-Yehuda,et al. On approximating a geometric prize-collecting traveling salesman problem with time windows , 2005, J. Algorithms.
[29] Guy Kortsarz,et al. On network design problems: fixed cost flows and the covering steiner problem , 2002, TALG.
[30] Guy Kortsarz,et al. A greedy approximation algorithm for the group Steiner problem , 2006, Discret. Appl. Math..
[31] Alex Zelikovsky,et al. A series of approximation algorithms for the acyclic directed steiner tree problem , 1997, Algorithmica.