Author:
Zhang Jiaxuan,Gao Suogang,Hou Bo,Liu Wen
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference23 articles.
1. Agrawal A, Klein P, Ravi R (1995) When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J Comput 24:440–456
2. Bienstock D, Goemans MX, Simchi-Levi D, Williamson D (1993) A note on the prize collecting traveling salesman problem. Math Program 59:413–420
3. Chekury C, Even G, Kortsarz G (2002) An approximation algorithm for the group Steiner problem. In: Proceedings of the symposium on discrete algorithms SODA, San Francisco, California, pp 49–58
4. Coffman J, Weaver AC (2014) An empirical performance evaluation of relational keyword search techniques. IEEE Trans Knowl Data Eng 26(1):30–42
5. Du DZ, Ko KI, Hu XD (2012) Design and analysis of approximation algorithm. Springer, New York