Approximation algorithms for hamming clustering problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1848, Issue , 2000, Pages 108-118

  G Ą Sieniec, Leszek ^a   Jansson, Jesper ^b   Lingas, Andrzej ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; HAMMING DISTANCE; INTEGER PROGRAMMING; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

BINARY STRING; CLUSTERING PROBLEMS; CONSTANT FACTORS; EXACT SOLUTION; HAMMING CLUSTERING; INTEGER PROGRAMMING FORMULATIONS; MINIMUM VALUE; POLYNOMIAL-TIME;

CLUSTERING ALGORITHMS;

EID: 84937395783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. M. Bellare, O. Goldreich, and M. Sudan. Free Bits, PCPs, and Non- Approximability-Towards Tight Results. SIAM Journal on Computing 27(3), 1998, pp. 804-915.
2. M. Chrobak and T.H. Payne. A linear-time algorithm for drawing a planar graph on a grid. Information Processing Letters 54, 1995, pp. 241-246.
3. T. Feder and D. Greene. Optimal Algorithms for Approximate Clustering. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC'88), 1988, pp. 434-444.
4. M. Frances and A. Litman. On Covering Problems of Codes. Theory of Computing Systems 30, 1997, pp. 113-119.
5. L. Gąsieniec, J. Jansson, and A. Lingas. Efficient Approximation Algorithms for the Hamming Center Problem. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), 1999, pp. S905-S906.
6. T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38, 1985, pp. 293-306.
7. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
8. D.S. Hochbaum (editor). Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, 1997.
9. D.S. Hochbaum and D.B. Shmoys. A best possible heuristic for the k-center prob- lem. Mathematics of Operational Research 10(2), 1985, pp. 180-184.
10. D.S. Hochbaum and D.B. Shmoys. A Unified Approach to Approximation Algorithms for Bottleneck Problems. Journal of the Association for Computing Machinery 33(3), 1986, pp. 533-550.
11. B. Kolman, R. Busby, and S. Ross. Discrete Mathematical Structures [3rd ed.]. Prentice Hall, New Jersey, 1996.
12. J.K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang. Distinguishing String Selection Problems. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), 1999, pp. 633-642.
13. M. Li, B. Ma, and L. Wang, Finding Similar Regions in Many Strings. Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC'99), 1999, pp. 473-482.
14. C. Papadimitriou. On the Complexity of Integer Programming. Journal of the ACM 28(4), 1981, pp. 765-768.
15. S. Vishwanathan. An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'96), 1996, pp. 1-5.