Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2484381216 / rank | |||
Normal rank | |||
Revision as of 19:18, 19 March 2024
scientific article; zbMATH DE number 7048072
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
