Probabilistic analysis of some Euclidean clustering problems

DOI10.1016/0166-218X(80)90026-8zbMath0449.90073WikidataQ57401648 ScholiaQ57401648MaRDI QIDQ1147633

Alan M. Frieze

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationprobabilistic analysispolynomial algorithmsset partitioningEuclidean clustering problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial aspects of partitions of integers (05A17)

Related Items

Maximal paths in random dynamic graphs ⋮ Unnamed Item ⋮ Aggregation error for location models: Survey and analysis

Cites Work

• The Euclidean traveling salesman problem is NP-complete
• Probabilistic Analysis of the Planar k-Median Problem
• Unnamed Item