Approximation algorithms for the class cover problem

Annals of Mathematics and Artificial Intelligence

Volumn 40, Issue 3-4, 2004, Pages 215-223

  Cannon, Adam H ^a   Cowen, Lenore J ^b  

^a MC 0401 ^*  (United States)

^b Tufts University   (United States)

Author keywords

Approximation algorithms; Classification; Disk cover; Margin classifier; Set cover

Indexed keywords

EID: 4043109157     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/b:amai.0000012867.03976.a5     Document Type: Article

References (11)

1. S. Arora and C. Lund, Hardness of approximations, in: Approximation Algorithms for NP-Hard Problems, ed. D.S. Hochbaum (PWS Publishing Company, 1997).
2. P.S. Bradley, U.M. Fayyad and O.L. Mangasarian, Mathematical programming for data mining: Formulatons and challenges, Technical Report (January 1998).
3. H. Bronnimann and M. Goodrich, Almost optimal set covers in finite VC-dimension, Discrete Comput. Geom. 14 (1995) 463-479.
4. A.H. Cannon, L.J. Cowen and C.E. Priebe, Approximate distance classification, in: Computer Science and Statistics, Proceedings of the 30th Symposium on the Interface (1998).
5. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (McGraw-Hill, 1990).
6. L.J. Cowen and C.E. Priebe, Randomized non-linear projectons uncover high-dimensional structure, Advances in Applied Mathematics 19 (1997) 319-331.
7. D.S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, Journal of the ACM 32 (1985) 130-136.
8. N. Linial, E. London and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (1995) 215-245.
9. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41(5) (1996) 960-981.
10. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences 43 (1991) 425-440.
11. L.J. Schulman, Clustering for edge-cost minimization, Electronic Colloquium on Computational Complexity (ECCC) 6(035) (1999).