Linear time algorithm for 1-center in \(\mathfrak {R}^d\) under convex polyhedral distance function (Q4632168)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7048072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time algorithm for 1-center in \(\mathfrak {R}^d\) under convex polyhedral distance function |
scientific article; zbMATH DE number 7048072 |
Statements
Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (English)
0 references
26 April 2019
0 references
0 references
0.8756451606750488
0 references
0.7944096922874451
0 references
0.7934848666191101
0 references
0.7878939509391785
0 references
