Pages that link to "Item:Q1675840"
From MaRDI portal
The following pages link to Algorithms for constructing optimal \(n\)-networks in metric spaces (Q1675840):
Displaying 10 items.
- Method for constructing optimal dark coverings (Q1991636) (← links)
- On covering bounded sets by collections of circles of various radii (Q2307921) (← links)
- Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
- Algorithms of the best approximations of the flat sets by the union of circles (Q2932425) (← links)
- On reserve and double covering problems for the sets with non-Euclidean metrics (Q3388412) (← links)
- Methods of optimization of Hausdorff distance between convex rotating figures (Q3388837) (← links)
- (Q5153818) (← links)
- Chebyshev centres, Jung constants, and their applications (Q5220255) (← links)
- Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces (Q5307533) (← links)
- On covering of cylindrical and conical surfaces with equal balls (Q6572951) (← links)