Probabilistic analysis of some Euclidean clustering problems (Q1147633): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/dam/Frieze80, #quickstatements; #temporary_batch_1731505720702 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401648 / rank | |||
Normal rank | |||
| 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 | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dam/Frieze80 / rank | |||
Normal rank | |||
Latest revision as of 16:01, 13 November 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
