Author:
Khosravian Ghadikoalei Mehdi,Melissinos Nikolaos,Monnot Jérôme,Pagourtzis Aris
Publisher
Springer International Publishing
Reference30 articles.
1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-58412-1
2. Lecture Notes in Computer Science;C Bazgan,2016
3. Bazgan, C., et al.: The many facets of upper domination. Theor. Comput. Sci. 717, 2–25 (2018)
4. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Electronic Colloquium on Computational Complexity (ECCC) (049) (2003)
5. Boria, N., Croce, F.D., Paschos, V.T.: On the max min vertex cover problem. Discrete Appl. Math. 196, 62–71 (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献