Static and dynamic algorithms for k-point clustering problems (Q5060119): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-57155-8_254 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1596202017 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding k points with minimum diameter and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposable searching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3140402 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4230362 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maintaining the minimal distance of a point set in polylogarithmic time / rank | |||
Normal rank | |||
Latest revision as of 07:47, 31 July 2024
scientific article; zbMATH DE number 7643391
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Static and dynamic algorithms for k-point clustering problems |
scientific article; zbMATH DE number 7643391 |
Statements
Static and dynamic algorithms for k-point clustering problems (English)
0 references
18 January 2023
0 references
