We study bounded degree graph problems, mainly the problem of k-Dimensional Matching \emph{(k-DM)}, namely, the problem of finding a maximal matching in a k-partite k-uniform balanced hyper-graph. We prove that k-DM cannot be efficiently approximated to within a factor of $ O(\frac{k}{ \ln k}) $ unless $P = NP$. This ... more >>>