Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints |
scientific article |
Statements
Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (English)
0 references
18 May 2020
0 references
Euclidean 1-center
0 references
minimum intersecting ball
0 references
minimum stabbing ball
0 references
minimum enclosing circle
0 references
0 references
