关于强度量维数计算的最佳逼近性结果
On optimal approximability results for computing the strong metric dimension
摘要:
图的强度量维数最早是由Sebö和Tannier提出的(Mathematics of Operations Research,29(2),383-393,2004)作为Slater先前独立引入的图的(弱)度量维数的替代(Proc.6th Southeastern Conference on Combinatorics,Graph Theory,and Computing,549-559,1975),Harary和Melter(Ars Combinatoria,2,191-195,1976),并已在几篇研究论文中进行了研究。然而,计算强度量维度的确切最坏情况计算复杂度仍然是NP完全的。在本文中,我们证明了计算$n$节点图的强度量维数的问题允许多项式时间$2$ -近似,允许$O^\ast\big(2^{\,0.287\,n}\big)$ -时间精确计算算法,如果强度量维数至多为$k$,则允许$O\big(1.2738^k+n\,k\big)$ -时间精确计算算法,不允许多项式时间$(2-\varepsilon)$ -近似算法,假设唯一博弈猜想为真,不承认假设P $\neq$ NP的多项式时间$(10\sqrt{5}-21-\varepsilon)$ -近似算法,不承认假设指数时间假设为真的$O^\ast\big(2^{o(n)}\big)$ -时间精确计算算法,并且如果假设指数时间假设为真的强度量维数至多为$k$,则不承认$O^\ast\big(n^{o(k)}\big)$ -时间精确计算算法。
英文摘要:
The strong metric dimension of a graph was first introduced by Sebö and Tannier (Mathematics of Operations Research, 29(2), 383-393, 2004) as an alternative to the (weak) metric dimension of graphs previously introduced independently by Slater (Proc. 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 549-559, 1975) and by Harary and Melter (Ars Combinatoria, 2, 191-195, 1976), and has since been investigated in several research papers. However, the exact worst-case computational complexity of computing the strong metric dimension has remained open beyond being NP-complete. In this communication, we show that the problem of computing the strong metric dimension of a graph of $n$ nodes admits a polynomial-time $2$-approximation, admits a $O^\ast\big(2^{\,0.287\,n}\big)$-time exact computation algorithm, admits a $O\big(1.2738^k+n\,k\big)$-time exact computation algorithm if the strong metric dimension is at most $k$, does not admit a polynomial time $(2-\varepsilon)$-approximation algorithm assuming the unique games conjecture is true, does not admit a polynomial time $(10\sqrt{5}-21-\varepsilon)$-approximation algorithm assuming P$\neq$NP, does not admit a $O^\ast\big(2^{o(n)}\big)$-time exact computation algorithm assuming the exponential time hypothesis is true, and does not admit a $O^\ast\big(n^{o(k)}\big)$-time exact computation algorithm if the strong metric dimension is at most $k$ assuming the exponential time hypothesis is true.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。