Survival of the sparsest: robust gene networks are parsimonious
O(√log n) approximation to SPARSEST CUT in O˜(n2) time
On the Hardness of Approximating Multicut and Sparsest-Cut
On the hardness of approximating MULTICUT and SPARSEST-CUT
Sparsest solutions of underdetermined linear systems via [formula omitted]-minimization for [formula omitted]
A plurality of sparse representations is better than the sparsest one alone
A Plurality of Sparse Representations Is Better Than the Sparsest One Alone
For most large underdetermined systems of linear equations the minimal $l^1$ solution is also the sparsest solution
For Most Large Underdetermined Systems of Linear Equations the Minimal L1-norm Solution is also the Sparsest Solution
Donoho, D.L.: For Most Large Underdetermined Systems of Linear Equations the Minimal L(1)-norm Solution Is also the Sparsest Solutio...