Approximation algorithms for Hamming clustering problems

DOI10.1016/S1570-8667(03)00079-0zbMath1118.68762OpenAlexW2033556263MaRDI QIDQ876719

Jesper Jansson, Andrzej Lingas, Leszek Gąsieniec

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00079-0

zbMATH Keywords

integer programmingHamming distanceapproximation algorithms\(p\)-clustering problemnp-hardness

Mathematics Subject Classification ID

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

Related Items (7)

The complexity of binary matrix completion under diameter constraints ⋮ On the parameterized complexity of clustering problems for incomplete data ⋮ On the interpoint distances of Bernoulli vectors ⋮ Low-Rank Binary Matrix Approximation in Column-Sum Norm. ⋮ Anonymizing binary and small tables is hard to approximate ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ A new class of weighted similarity indices using polytomous variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On covering problems of codes
• Clustering to minimize the maximum intercluster distance
• Finding similar regions in many strings
• A Best Possible Heuristic for the k-Center Problem
• On the complexity of integer programming
• Algorithms on Strings, Trees and Sequences
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results

This page was built for publication: Approximation algorithms for Hamming clustering problems