  A particular instance of the Shortest Vector Problem (SVP) appears in the
context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will
show that this certain instance can be solved in complexity order
$O(n\psi\log(n\psi))$ where $\psi = \sqrt{P\|{\bf h}\|^2+1}$ depends on the
transmission power and the norm of the channel vector. We will then extend our
results to Integer-Forcing and finally, introduce a more general class of
lattices for which the SVP and the and the Closest Vector Problem (CVP) can be
approximated within a constant factor.
