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

DOI10.3390/a1020043zbMath1461.62102OpenAlexW2077513533MaRDI QIDQ1662431

Yen Kaow Ng, Shuai Cheng Li, 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

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

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