@article {
author = {Heidari, Vahid and Moazzami, Dara},
title = {A note on the approximability of the tenacity of graphs},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {2},
pages = {149-157},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2020.79270},
abstract = {In this paper we show that, if $NP\neq ZPP$, for any $\epsilon > 0$, the tenacity of graphwith $n$ vertices is not approximable in polynomial time within a factor of$\frac{1}{2} \left( \frac{n-1}{2} \right) ^{1-\epsilon}$.},
keywords = {$NP$-complete problem,Tenacity,Tenacious,$NP$-hard},
url = {https://jac.ut.ac.ir/article_79270.html},
eprint = {https://jac.ut.ac.ir/article_79270_0a4d1e9aa72c099beb4fcfe521d1bc23.pdf}
}