scientific article; zbMATH DE number 1303550
From MaRDI portal
Publication:4250174
Recommendations
Cited in
(12)- Lower Bounds for Geometric Diameter Problems
- Fast algorithms for computing the diameter of a finite planar set
- On finding a large number of 3D points with a small diameter
- scientific article; zbMATH DE number 4041267 (Why is no real title available?)
- On computing the diameter of a point set in high dimensional Euclidean space.
- A tight lower bound for computing the diameter of a 3D convex polytope
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
- A memetic algorithm to schedule planned maintenance for the national grid
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
- Quantum speed-up for unsupervised learning
- Diameter, width, closest line pair, and parametric searching
- An efficient algorithm for the three-dimensional diameter problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250174)
