Journal of Algorithms and Computation

Open Access

Current Issue

By Issue

By Author

By Subject

Author Index

Keyword Index

About Journal

Aims and Scope

Editorial Board

Publication Ethics

Indexing and Abstracting

Related Links

FAQ

Peer Review Process

Journal Metrics

News

Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)

Keywords = $NP$-complete problem

Number of Articles: 1
A note on the approximability of the tenacity of graphs

Vahid Heidari; Dara Moazzami

Volume 52, Issue 2 , December 2020, , Pages 149-157

https://doi.org/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}$.  Read More