TY - GEN
T1 - Matrix sparsification and the sparse null space problem
AU - Gottlieb, Lee Ad
AU - Neylon, Tyler
PY - 2010
Y1 - 2010
N2 - We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.
AB - We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.
UR - http://www.scopus.com/inward/record.url?scp=78149306565&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15369-3_16
DO - 10.1007/978-3-642-15369-3_16
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:78149306565
SN - 3642153682
SN - 9783642153686
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 205
EP - 218
BT - Approximation, Randomization, and Combinatorial Optimization
T2 - 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010
Y2 - 1 September 2010 through 3 September 2010
ER -