Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference18 articles.
1. P. Alimonti, T. Calamoneri, Improved approximations of independent dominating set in bounded degree graphs, in: Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG, LNCS, 1996, pp. 2–16.
2. Complexity and Approximation;Ausiello,1999
3. Approximation hardness of edge dominating set problems;Chlebı´k;Journal of Combinatorial Optimization,2006
4. Complexity of approximating bounded variants of optimization problems;Chlebı´k;Theoretical Computer Science,2006
5. I. Dinur, V. Guruswami, S. Khot, O. Regev, A new multilayered PCP and the hardness of hypergraph vertex cover, in: Proceedings of the 35th ACM Symposium on Theory of Computing, STOC, 2003, pp. 595–601.
Cited by
130 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献