scientific article; zbMATH DE number 1615274

MaRDI QIDQ2723944zbMATH OpenFDO

Authors Jesper Jansson, Leszek Gąsieniec, Andrzej Lingas

Publication date 8 July 2001

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for Hamming clustering problems
• scientific article; zbMATH DE number 1305511
• On the Efficiency of the Hamming C-Centerstring Problems
• Clustering to minimize the maximum intercluster distance
• Approximation algorithms for clustering to minimize the sum of diameters

Cited in

(6)

• Ensemble clustering using semidefinite programming with applications
• Clustering, Hamming Embedding, Generalized LSH and the Max Norm
• scientific article; zbMATH DE number 1305511 (Why is no real title available?)
• On computing centroids according to the p-norms of Hamming distance vectors
• The consensus string problem for a metric is NP-complete
• Approximation algorithms for Hamming clustering problems

This page was built for publication:

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