Probabilistic analysis of some Euclidean clustering problems (Q1147633): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57401648, #quickstatements; #temporary_batch_1714786519576 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Probabilistic Analysis of the Planar <i>k</i>-Median Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4155835 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank | |||
Normal rank | |||
Revision as of 11:06, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of some Euclidean clustering problems |
scientific article |
Statements
Probabilistic analysis of some Euclidean clustering problems (English)
0 references
1980
0 references
probabilistic analysis
0 references
Euclidean clustering problems
0 references
polynomial algorithms
0 references
set partitioning
0 references
combinatorial optimization
0 references
