Skip to main content
SpringerLink
Log in

Approximation Algorithms for the Class Cover Problem

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We introduce the class cover problem, a variant of disk cover with forbidden regions, with applications to classification and facility location problems. We prove similar hardness results to disk cover. We then present a polynomial-time approximation algorithm for class cover that performs within a ln n+1 factor of optimal, which is nearly tight under standard hardness assumptions. In the special case that the points lie in a d-dimensional space with Euclidean norm, for some fixed constant d, we obtain a polynomial time approximation scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  8. N. Linial, E. London and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (1995) 215–245.

    Google Scholar 

  9. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41(5) (1996) 960–981.

    Google Scholar 

  10. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences 43 (1991) 425–440.

    Google Scholar 

  11. L.J. Schulman, Clustering for edge-cost minimization, Electronic Colloquium on Computational Complexity (ECCC) 6(035) (1999).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, MC 0401, New York, NY, 10027, USA

    Adam H. Cannon

  2. Department of Computer Science, Tufts University, Halligan Hall, 161 College Avenue, Medford, MA, 02140, USA

    Lenore J. Cowen

Authors
  1. Adam H. Cannon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lenore J. Cowen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cannon, A.H., Cowen, L.J. Approximation Algorithms for the Class Cover Problem. Annals of Mathematics and Artificial Intelligence 40, 215–223 (2004). https://doi.org/10.1023/B:AMAI.0000012867.03976.a5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AMAI.0000012867.03976.a5

Search

Navigation