Approximation algorithms for geometric median problems (Q1209349): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Clustering to minimize the maximum intercluster distance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3050157 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank | |||
Normal rank | |||
Revision as of 15:35, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for geometric median problems |
scientific article |
Statements
Approximation algorithms for geometric median problems (English)
0 references
16 May 1993
0 references
euclidean spaces
0 references
clustering
0 references
linear programming
0 references
approximation
0 references
median
0 references
metric spaces
0 references
relaxation
0 references
rounding
0 references
0 references
