Pages that link to "Item:Q3000502"
From MaRDI portal
The following pages link to On Approximation Complexity of Metric Dimension Problem (Q3000502):
Displaying 8 items.
- Approximation complexity of metric dimension problem (Q450564) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- On approximation algorithm for the edge metric dimension problem (Q2220845) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- On the Complexity of Metric Dimension (Q2912859) (← links)
- (Q4980113) (← links)
- A note on the complexity of \(k\)\textsc{-metric dimension} (Q6096304) (← links)