Author:
Casel Katrin,Fernau Henning,Khosravian Ghadikolaei Mehdi,Monnot Jérôme,Sikora Florian
Publisher
Springer International Publishing
Reference32 articles.
1. Lecture Notes in Computer Science;C Bazgan,2016
2. Bazgan, C., et al.: The many facets of upper domination. Theor. Comput. Sci. 717, 2–25 (2018)
3. Berger, A., Fukunaga, T., Nagamochi, H., Parekh, O.: Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385(1–3), 202–213 (2007)
4. Berger, A., Parekh, O.: Linear time algorithms for generalized edge dominating set problems. Algorithmica 50(2), 244–254 (2008)
5. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. ECCC (049) (2003)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献