On the Parameterized and Approximation Hardness of Metric Dimension.
Sepp HartungAndré NichterleinPublished in: Computational Complexity Conference (2013)
Keyphrases
- approximation error
- approximation algorithms
- np hard
- metric space
- genetic algorithm
- computational complexity
- special case
- euclidean metric
- error estimates
- multiple dimensions
- approximation ratio
- relative error
- metric learning
- evaluation metrics
- phase transition
- error bounds
- np complete
- distance measure
- probabilistic model
- search algorithm