Given a mbyn matrix with $n>>m$ and with a known rank of $k\leq m$, what would be a computationally effective way of finding out $k$ columns, such that the matrix formed using these $k$ columns has the best condition number?

Finding this subset of columns is a nontrivial task, but some approximate answers are known. For details and pointers, please refer to my answer here. 

