Algorithms and hardness for Metric Dimension on digraphs.
Antoine DaillyFlorent FoucaudAnni HakanenPublished in: CoRR (2023)
Keyphrases
- computationally efficient
- data structure
- computational complexity
- times faster
- orders of magnitude
- recently developed
- computational cost
- optimization problems
- worst case
- data sets
- distance measure
- phase transition
- convergence rate
- computationally expensive
- distance metric
- benchmark datasets
- lower bound
- reinforcement learning
- data mining