Efficient approximation algorithms for the Hamming center problem

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas

Research output: Contribution to conferencePaper

38 Scopus citations

Abstract

The Hamming center problem for a set S of k binary strings, each of length n, is to find a binary string β of length n that minimizes the maximum Hamming distance between β and any string in S. Its decision version is known to be NP-complete. We provide several approximation algorithms for the Hamming center problem. Our main result is a randomized (4/3+ε) approximation algorithm running in polynomial time if the Hamming radius of S is at least superlogarithmic in k. Furthermore, we show how to find in polynomial time a set B of O(log k) strings of length n such that for each string in S there is at least one string in B within Hamming distance not exceeding the radius of S.

Original languageEnglish (US)
PagesS905-S906
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: Jan 17 1999Jan 19 1999

Conference

ConferenceProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period1/17/991/19/99

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Efficient approximation algorithms for the Hamming center problem'. Together they form a unique fingerprint.

  • Cite this

    Gasieniec, L., Jansson, J., & Lingas, A. (1999). Efficient approximation algorithms for the Hamming center problem. S905-S906. Paper presented at Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, .