Approximation Algorithms for the Class Cover Problem |
| |
Authors: | Adam H. Cannon Lenore J. Cowen |
| |
Affiliation: | 1. Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, MC 0401, New York, NY, 10027, USA 2. Department of Computer Science, Tufts University, Halligan Hall, 161 College Avenue, Medford, MA, 02140, USA
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|