Norm statistics and the complexity of clustering problems

DOI10.1016/j.dam.2009.01.003zbMath1169.91019OpenAlexW2022786090MaRDI QIDQ1026145

Beth Novick

Publication date: 24 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.003

zbMATH Keywords

clusteringNP-hardnessstring propertyweighted power means

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Discrete location and assignment (90B80)

Related Items (2)

Exact algorithms for size constrained 2-clustering in the plane ⋮ On the complexity of redescription mining

Uses Software

• J-MEANS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A projection method for \(l_ p\) norm location-allocation problems
• Variable neighborhood search
• On Grouping for Maximum Homogeneity
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
• Integer Programming and the Theory of Grouping
• Cluster Analysis and Mathematical Programming
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: Norm statistics and the complexity of clustering problems