Given a set of n points in a d-dimensional Euclidean space, we
ask the question "how well can this set of points be approximated
by a lower dimensional affine subspace?" We give approximation
algorithm and inapproximability results for this NP-hard problem.