NP-hardness of some Euclidean problems of partitioning a finite set of points

DOI10.1134/S0965542518050123zbMATH Open1393.68176OpenAlexW2807997940WikidataQ129700851 ScholiaQ129700851MaRDI QIDQ1662580FDOQ1662580

A. V. Kel'manov, Artem Pyatkin

Publication date: 20 August 2018

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542518050123

Recommendations

• On the complexity of some Euclidean problems of partitioning a finite set of points
• NP-hardness of some quadratic Euclidean 2-clustering problems
• NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
• On the complexity of some quadratic Euclidean partition problems into balanced clusters
• Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters

zbMATH Keywords

NP-hardnessEuclidean spacepartitioningnorm of sum

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The elements of statistical learning. Data mining, inference, and prediction
• Pattern recognition and machine learning.
• Title not available (Why is that?)
• On the complexity of some Euclidean optimal summing problems
• Complexity of certain problems of searching for subsets of vectors and cluster analysis
• Data Mining

Cited In (2)

• Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space
• Title not available (Why is that?)

Uses Software

• ElemStatLearn
• PRMLT

This page was built for publication: NP-hardness of some Euclidean problems of partitioning a finite set of points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662580)