On the parameterized and approximation hardness of metric dimension

14 Sepp Hartung, André Nichterlein · 2013

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.CC · 2019-07-18 · unverdicted · novelty 8.0

Metric Dimension parameterized by treewidth is W[1]-hard, with no f(pw)n^{o(pw)} algorithm under ETH on constant-degree graphs.

Showing 1 of 1 citing paper.

Metric Dimension Parameterized by Treewidth cs.CC · 2019-07-18 · unverdicted · none · ref 13
Metric Dimension parameterized by treewidth is W[1]-hard, with no f(pw)n^{o(pw)} algorithm under ETH on constant-degree graphs.