{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T22:09:44Z","timestamp":1759010984981},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,4]],"date-time":"2015-08-04T00:00:00Z","timestamp":1438646400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00453-015-0042-6","type":"journal-article","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T15:22:23Z","timestamp":1438615343000},"page":"426-444","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Matrix Sparsification and the Sparse Null Space Problem"],"prefix":"10.1007","volume":"76","author":[{"given":"Lee-Ad","family":"Gottlieb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tyler","family":"Neylon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"issue":"1\u20132","key":"42_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","volume":"147","author":"E Amaldi","year":"1995","unstructured":"Amaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theor. Comput. Sci. 147(1\u20132), 181\u2013210 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"42_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S Arora","year":"1997","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes and linear equations. J. Comput. Syst. Sci. 54(2), 317\u2013331 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"42_CR3","unstructured":"Berman, Piotr., Karpinski, Marek.: Approximating minimum unsatisfiability of linear equations. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201902, pp. 514\u2013516. Society for Industrial and Applied Mathematics (2002)"},{"issue":"4","key":"42_CR4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/BF01389453","volume":"47","author":"M Berry","year":"1985","unstructured":"Berry, M., Heath, M., Kaneko, I., Lawo, M., Plemmons, R., Ward, R.: An algorithm to compute a sparse basis of the null space. Numer. Math. 47(4), 483\u2013504 (1985)","journal-title":"Numer. Math."},{"issue":"1","key":"42_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895479892230067","volume":"16","author":"RA Brualdi","year":"1995","unstructured":"Brualdi, R.A., Friedland, S., Pothen, A.: The sparse basis problem and multilinear algebra. SIAM J. Matrix Anal. Appl. 16(1), 1\u201320 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"42_CR6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"42_CR7","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20133","key":"42_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580890","volume":"56","author":"S Frank Chang","year":"1992","unstructured":"Chang, S.Frank, McCormick, S.Thomas: A hierarchical algorithm for making sparse matrices sparser. Math. Program. 56(1\u20133), 1\u201330 (1992)","journal-title":"Math. Program."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Chartrand, R.: Nonconvex compressed sensing and error correction. In: IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP \u201907, volume 3, pages III\u2013889\u2013III\u2013892, (April 2007)","DOI":"10.1109\/ICASSP.2007.366823"},{"issue":"2","key":"42_CR10","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1109\/18.119732","volume":"38","author":"R Coifman","year":"1992","unstructured":"Coifman, R., Wickerhauser, M.: Entropy-based algorithms for best basis selection. IEEE Trans. Inf. Theory 38(2), 713\u2013718 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"42_CR11","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/0607059","volume":"7","author":"TF Coleman","year":"1986","unstructured":"Coleman, T.F., Pothen, A.: The null space problem I. Complexity. SIAM J. Algebraic Discrete Methods 7(4), 527\u2013537 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"42_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00493-003-0019-y","volume":"23","author":"Irit Dinur","year":"2003","unstructured":"Dinur, Irit, Kindler, Guy, Raz, Ran, Safra, Shmuel: Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica 23(2), 205\u2013243 (2003)","journal-title":"Combinatorica"},{"issue":"6","key":"42_CR13","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"David L Donoho","year":"2006","unstructured":"Donoho, David L.: For most large underdetermined systems of linear equations the minimal $$\\ell _{1}$$ \u2113 1 -norm solution is also the sparsest solution. Commun. Pure Appl. Math. 59(6), 797\u2013829 (2006)","journal-title":"Commun. Pure Appl. Math."},{"key":"42_CR14","volume-title":"Direct Methods for Sparse Matrices","author":"IS Duff","year":"1986","unstructured":"Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford University Press, Oxford (1986)"},{"issue":"6","key":"42_CR15","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1109\/TIT.2004.828141","volume":"50","author":"JJ Fuchs","year":"2004","unstructured":"Fuchs, J.J.: On sparse representations in arbitrary redundant bases. IEEE Trans. Inf. Theory 50(6), 1341\u20131344 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Near-optimal sparse fourier representations via sampling. In: Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, STOC \u201902, pp. 152\u2013161. ACM (2002)","DOI":"10.1145\/509907.509933"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Muthukrishnan, S., Strauss, M.: Improved time bounds for near-optimal sparse fourier representations. In: Proceedings of SPIE Wavelets XI, vol. 5914, (2005)","DOI":"10.1117\/12.615931"},{"issue":"3","key":"42_CR18","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1137\/0608037","volume":"8","author":"JR Gilbert","year":"1987","unstructured":"Gilbert, J.R., Heath, M.T.: Computing a sparse basis for the null space. SIAM J Algebraic Discrete Methods 8(3), 446\u2013459 (1987)","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Higham, Nicholas J.: Accuracy and Stability of Numerical Algorithms. In: Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2nd edition, 2002. Chapter 28: A Gallery of Test Matrices (2002)","DOI":"10.1137\/1.9780898718027"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J., McCormick, S.T.: A fast algorithm that makes matrices optimally sparse. In: Progress in Combinatorial Optimization. Academic Press (1984)","DOI":"10.1016\/B978-0-12-566780-7.50017-9"},{"issue":"1","key":"42_CR21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(78)90006-3","volume":"6","author":"DS Johnson","year":"1978","unstructured":"Johnson, D.S., Preparata, F.P.: The densent hemisphere problem. Theor. Comput. Sci. 6(1), 93\u2013107 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"42_CR22","first-page":"317","volume":"1","author":"Viggo Kann","year":"1994","unstructured":"Kann, Viggo: Polynomially bounded minimization problems that are hard to approximate. Nordic J. Comput. 1(3), 317\u2013331 (1994)","journal-title":"Nordic J. Comput."},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: A faster algorithm for minimum cycle basis of graphs. In: Diaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) Automata, Languages and Programming, vol. 3142 of Lecture Notes in Computer Science, pp. 846\u2013857. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-27836-8_71"},{"key":"42_CR24","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. Amsterdam, North-Holland (1983)"},{"key":"42_CR25","volume-title":"Understanding and Using Linear Programming","author":"J Matous\u0306ek","year":"2007","unstructured":"Matous\u0306ek, J., Gartner, B.: Understanding and Using Linear Programming. Springer, NewYork (2007)"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"McCormick, S.T.: A combinatorial approach to some sparse matrix problems. Ph.D. thesis, Stanford Univ., Stanford, California, 1983. Technical Report 83-5, Stanford Optimization Lab (1983)","DOI":"10.21236\/ADA131387"},{"key":"42_CR27","unstructured":"Muthukrishnan, S.: Nonuniform sparse approximation with Haar wavelet basis. DIMACS TR:2004-42, (2004)"},{"issue":"2","key":"42_CR28","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"42_CR29","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.: Cosamp: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013322 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"42_CR30","unstructured":"Neylon, T.: Sparse Solutions for Linear Prediction Problems. Ph.D. thesis, New York University, New York (2006)"},{"key":"42_CR31","unstructured":"Pothen, A.: Sparse Null Bases and Marriage Theorems. Ph.D. thesis, Cornell University, Ithica, New York (1984)"},{"key":"42_CR32","doi-asserted-by":"crossref","unstructured":"Schmidt, E.: Zur thoerie der linearen und nichtlinearen integralgleichungen, I. Mathematische Annalen 64(4), 433\u2013476 (1906\u20131907)","DOI":"10.1007\/BF01449770"},{"issue":"3","key":"42_CR33","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1109\/29.21700","volume":"37","author":"S Singhal","year":"1989","unstructured":"Singhal, S.: Amplitude optimization and pitch prediction in multi-pulse coders. IEEE Trans. Acoust Speech Signal Process 37(3), 317\u2013327 (1989)","journal-title":"IEEE Trans. Acoust Speech Signal Process"},{"key":"42_CR34","unstructured":"Smola, Alex J., Sch\u00f6kopf, Bernhard.: Sparse greedy matrix approximation for machine learning. In Proceedings of the Seventeenth International Conference on Machine Learning, ICML \u201900, pp. 911\u2013918 (2000)"},{"issue":"1","key":"42_CR35","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s102080010029","volume":"3","author":"V Temlyakov","year":"2003","unstructured":"Temlyakov, V.: Nonlinear methods of approximation. Found. Comput. Math. 3(1), 33\u2013107 (2003)","journal-title":"Found. Comput. Math."},{"key":"42_CR36","doi-asserted-by":"crossref","unstructured":"Trefethen, L.N., Bau, D.: Numerical Linear Algebra. SIAM, Philadelphia, PA (1997)","DOI":"10.1137\/1.9780898719574"},{"issue":"10","key":"42_CR37","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp, J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50(10), 2231\u20132242 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"42_CR38","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"50","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A.: Just relax: convex programming methods for subset selection and sparse approximation. IEEE Trans. Inf. Theory 50(3), 1030\u20131051 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"42_CR39","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/TIT.2004.839492","volume":"51","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A.: Recovery of short, complex linear combinations via $$\\ell _1$$ \u2113 1 minimization. IEEE Trans. Inf. Theory 51(1), 188\u2013209 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"42_CR40","doi-asserted-by":"crossref","first-page":"525","DOI":"10.2307\/4145072","volume":"111","author":"X Wang","year":"2004","unstructured":"Wang, X.: A simple proof of Descartes\u2019 rule of signs. Am. Math. Mon. 111(6), 525\u2013526 (2004)","journal-title":"Am. Math. Mon."},{"issue":"7","key":"42_CR41","doi-asserted-by":"crossref","first-page":"3540","DOI":"10.1109\/TIT.2010.2048473","volume":"56","author":"John Wright","year":"2010","unstructured":"Wright, John, Ma, Yi: Dense error correction via l1-minimization. IEEE Trans. Inf. Theor. 56(7), 3540\u20133560 (2010)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"42_CR42","doi-asserted-by":"crossref","unstructured":"Zhao, X., Zhang, X., Neylon, T., Shasha, D.: Incremental methods for simple problems in time series: algorithms and experiments. In Ninth International Database Engineering and Applications Symposium (IDEAS 2005), pages 3\u201314 (2005)","DOI":"10.1109\/IDEAS.2005.35"},{"key":"42_CR43","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/j.jcp.2005.06.005","volume":"211","author":"J Zhou","year":"2006","unstructured":"Zhou, J., Gilbert, A., Strauss, M., Daubechies, I.: Theoretical and experimental analysis of a randomized algorithm for sparse fourier transform analysis. J. Comput. Phys. 211, 572\u2013595 (2006)","journal-title":"J. Comput. Phys."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0042-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0042-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0042-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T01:01:59Z","timestamp":1567040519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0042-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,4]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0042-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,4]]}}}