arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.06343cs.CCcs.DS
收藏

标准Pebble对策和难Pebble图的不可逼近性

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Erik D. Demaine, Quanquan C. Liu

摘要:

卵石游戏是DAG上的单人游戏,涉及根据一定的规则集在图的节点上放置和移动卵石。目标是使用最少数量的pebble来pebble一组目标节点。本文给出了[CLNV 15]中结果的一个可能更简单的证明,并加强了该结果,证明了对于所有$ε> 0$,确定加性$n^{1/3-ε}$项的最小卵石数是PSPACE困难的,这改进了标准卵石博弈中目前已知的加性常数近似硬度[CLNV 15].我们还介绍了一个家庭的明确的,恒定的入度图与$n$节点,其中存在一个图的家庭,使使用恒定的$k$卵石需要$Ω(n^k)$移动卵石在标准和黑白卵石游戏。这独立地回答了[Nor15]中总结的一个开放性问题,即是否存在满足$O(n^k)$移动上限的DAG家族,该DAG家族使用具有与[AdRNV 17]中提出的不同结构的恒定$k$卵石。

英文摘要:

Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the graph according to a certain set of rules. The goal is to pebble a set of target nodes using a minimum number of pebbles. In this paper, we present a possibly simpler proof of the result in [CLNV15] and strengthen the result to show that it is PSPACE-hard to determine the minimum number of pebbles to an additive $n^{1/3-ε}$ term for all $ε> 0$, which improves upon the currently known additive constant hardness of approximation [CLNV15] in the standard pebble game. We also introduce a family of explicit, constant indegree graphs with $n$ nodes where there exists a graph in the family such that using constant $k$ pebbles requires $Ω(n^k)$ moves to pebble in both the standard and black-white pebble games. This independently answers an open question summarized in [Nor15] of whether a family of DAGs exists that meets the upper bound of $O(n^k)$ moves using constant $k$ pebbles with a different construction than that presented in [AdRNV17].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑