A PTAS for the k-consensus structures problem under squared Euclidean distance

DOI10.3390/A1020043zbMATH Open1461.62102OpenAlexW2077513533MaRDI QIDQ1662431FDOQ1662431

Authors: Shuai Cheng Li, Yen Kaow Ng, Louxin Zhang 

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a1020043

Recommendations

• A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance
• Approximation schemes for clustering problems
• Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
• scientific article; zbMATH DE number 6297742
• On variants of \(k\)-means clustering

zbMATH Keywords

algorithmpolynomial-time approximation scheme (PTAS)clustering 3D point sequencessquared Euclidean distance

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25) Other natural sciences (mathematical treatment) (92F05)

Cites Work

• Finding Compact Structural Motifs

Cited In (1)

• A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance

This page was built for publication: A PTAS for the \(k\)-consensus structures problem under squared Euclidean distance

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