PTAS for problems of vector choice and clustering with different centers

DOI10.33048/DAIO.2023.30.763MaRDI QIDQ6644072

Artem Pyatkin

Publication date: 27 November 2024

Published in: Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

zbMATH Keywords

clusteringapproximationPTAScentroidMSSCmedoid

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
• On the complexity of a search for a subset of ``similar vectors
• NP-hardness of Euclidean sum-of-squares clustering
• NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes
• Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
• On Grouping for Maximum Homogeneity
• Grouping Multidimensional Data
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Faster Scaling Algorithms for Network Problems
• An approximation scheme for a problem of search for a vector subset
• A 2-approximation polynomial algorithm for a clustering problem

This page was built for publication: PTAS for problems of vector choice and clustering with different centers

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