Author:
Kacem Imed,Paschos Vangelis Th.
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference24 articles.
1. Reductions, completeness and the hardness of approximability;Ausiello;European Journal of Operational Research,2006
2. On an approximation measure founded on the links between optimization and polynomial approximation theory;Demange;Theoretical Computer Science,1996
3. z-approximations;Hassin;Journal of Algorithms,2001
4. U. Feige, J. Kilian, Zero knowledge and the chromatic number, in: Proc. Conference on Computational Complexity, 1996, pp. 278–287.
5. R. Duh, M. Fürer, Approximation of k-set cover by semi-local optimization, in: Proc. STOC’97, 1997, pp. 256–265.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献