Abstract
The Hamming center problem for a set S of k binary strings, each of length n, is to find a binary string fl of length n that minimizes the maximum Hamming distance between p and any string in S. Its decision version is known to be NP-complete [2]. We provide several approximation algorithms for the Hamming center problem. Our main result is a randomized ($ + E)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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
