Author:
Chen Zhi-Zhong,Jiang Tao,Lin Guohui,Wen Jianjun,Xu Dong,Xu Jinbo,Xu Ying
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math. 1985 (25) 27–46.
2. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, B. Schieber, A unified approach to approximating resource allocation and scheduling, in: Proc. 32nd ACM Symp. on Theory of Computing (STOC’00), 2000, pp. 735–744.
3. C. Bartels, P. Güntert, M. Billeter, K. Wüthrich, GARANT-A general algorithm for resonance assignment of multidimensional nuclear magnetic resonance spectra, J. Comput. Chem. 1996 (18) 139–149.
4. P. Berman, A d/2 approximation for maximum weight independent set in d-claw free graphs, in: Proc. Seventh Scand. Workshop on Algebraic Theory (SWAT’00), Lecture Notes in Computer Science, Vol. 1851, 2000, pp. 214–219.
5. B. Chandra, M.M. Halldórsson, Greedy local improvement and weighted set packing approximation, in: ACM-SIAM Proc. 10th Ann. Symp. on Discrete Algorithms (SODA’99), 1999, pp. 169–176.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献