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 [4] and strengthen the result to show that it is PSPACE-hard to determine the minimum number of pebbles to an additive n1/3−εterm for all ε > 0, which improves upon the currently known additive constant hardness of approximation [4] 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 0 < k
CITATION STYLE
Demaine, E. D., & Liu, Q. C. (2017). Inapproximability of the standard pebble game and hard to pebble graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10389 LNCS, pp. 313–324). Springer Verlag. https://doi.org/10.1007/978-3-319-62127-2_27
Mendeley helps you to discover research relevant for your work.