scientific article

zbMath1249.90186MaRDI QIDQ3115255

A. V. Dolgushev, Alexander Kel'Manov

Publication date: 20 February 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cluster analysisNP-hardnessefficient approximate algorithmsearch for a vector subset

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (11)

Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem ⋮ A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum ⋮ An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors ⋮ A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem ⋮ Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters ⋮ Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster ⋮ Exact pseudopolynomial algorithms for a balanced 2-clustering problem ⋮ Solving some vector subset problems by Voronoi diagrams ⋮ Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center ⋮ Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability ⋮ A randomized algorithm for two-cluster partition of a set of vectors

This page was built for publication: