{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:04:30Z","timestamp":1725563070842},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_16","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T04:01:36Z","timestamp":1282881696000},"page":"205-218","source":"Crossref","is-referenced-by-count":11,"title":["Matrix Sparsification and the Sparse Null Space Problem"],"prefix":"10.1007","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","reference":[{"issue":"1-2","key":"16_CR1","doi-asserted-by":"publisher","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. Theoretical computer science\u00a0147(1-2), 181\u2013210 (1995)","journal-title":"Theoretical computer science"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes and linear equations. JCSS\u00a054(2) (1997)","DOI":"10.1006\/jcss.1997.1472"},{"key":"16_CR3","unstructured":"Berman, P., Karpinski, M.: Approximating minimum unsatisfiability of linear equations. Electronic Colloquium on Computational Complexity (ECCC)\u00a08(25) (2001)"},{"key":"16_CR4","doi-asserted-by":"publisher","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.\u00a047, 483\u2013504 (1985)","journal-title":"Numer. Math."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895479892230067","volume":"16","author":"R.A. Brualdi","year":"1995","unstructured":"Brualdi, R.A., Friedland, S., Pothen, A.: The sparse basis problem and multilinear algebra. SIAM Journal on Matrix Analysis and Applications\u00a016(1), 1\u201320 (1995)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"16_CR6","doi-asserted-by":"publisher","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. Inform. Theory\u00a052, 489\u2013509 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1-3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580890","volume":"56","author":"S. Frank Chang","year":"1992","unstructured":"Frank Chang, S., Thomas McCormick, S.: A hierarchical algorithm for making sparse matrices sparser. Mathematical Programming\u00a056(1-3), 1\u201330 (1992)","journal-title":"Mathematical Programming"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a038(2), 713\u2013718 (1992)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1137\/0607059","volume":"7","author":"T.F. Coleman","year":"1986","unstructured":"Coleman, T.F., Pothen, A.: The null space problem I. complexity. SIAM Journal on Algebraic and Discrete Methods\u00a07(4), 527\u2013537 (1986)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00493-003-0019-y","volume":"23","author":"I. Dinur","year":"2003","unstructured":"Dinur, I., Kindler, G., Raz, R., Safra, S.: Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica\u00a023(2), 205\u2013243 (2003)","journal-title":"Combinatorica"},{"key":"16_CR11","unstructured":"Donoho, D.L.: For most large underdetermined systems of linear equations, the minimal l1-norm solution is also the sparsest (2004), http:\/\/www-stat.stanford.edu\/~donoho\/Reports\/2004\/l1l0EquivCorrected.pdf"},{"key":"16_CR12","volume-title":"Direct Methods for Sparse Matrices","author":"I.S. 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":"16_CR13","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/TIT.2004.828141","volume":"50","author":"J.J. Fuchs","year":"2004","unstructured":"Fuchs, J.J.: On sparse representations in arbitrary redundant bases. IEEE Trans. Inf. Th.\u00a050(6), 1341\u20131344 (2004)","journal-title":"IEEE Trans. Inf. Th."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Near-optimal sparse fourier representations via sampling. In: STOC (2002)","DOI":"10.1145\/509907.509933"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Muthukrishnan, S., Strauss, M.: Improved time bounds for near-optimal sparse fourier representations. In: Proc. SPIE Wavelets XI (2005)","DOI":"10.1117\/12.615931"},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1137\/0608037","volume":"8","author":"J.R. Gilbert","year":"1987","unstructured":"Gilbert, J.R., Heath, M.T.: Computing a sparse basis for the null space. SIAM Journal on Algebraic and Discrete Methods\u00a08(3), 446\u2013459 (1987)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"16_CR17","volume-title":"Progress in Combinatorial Optimization","author":"A.J. Hoffman","year":"1984","unstructured":"Hoffman, A.J., McCormick, S.T.: A fast algorithm that makes matrices optimally sparse. In: Progress in Combinatorial Optimization. Academic Press, London (1984)"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(78)90006-3","volume":"6","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., Preparata, F.P.: The densent hemisphere problem. Theoret. Comput. Sci.\u00a06, 93\u2013107 (1978)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"16_CR19","first-page":"317","volume":"1","author":"V. Kann","year":"1994","unstructured":"Kann, V.: Polynomially bounded minimization problems that are hard to approximate. Nordic Journal of Computing\u00a01(3), 317\u2013331 (Fall 1994)","journal-title":"Nordic Journal of Computing"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1007\/978-3-540-27836-8_71","volume-title":"Automata, Languages and Programming","author":"T. Kavitha","year":"2004","unstructured":"Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: A faster algorithm for minimum cycle basis of graphs. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 846\u2013857. Springer, Heidelberg (2004)"},{"key":"16_CR21","volume-title":"Understanding and Using Linear Programming","author":"J. Matou\u0161ek","year":"2007","unstructured":"Matou\u0161ek, J., Gartner, B.: Understanding and Using Linear Programming. Springer, Heidelberg (2007)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"McCormick, S.T.: A combinatorial approach to some sparse matrix problems. PhD thesis, Stanford Univ., Stanford, California, Technical Report 83-5, Stanford Optimization Lab. (1983)","DOI":"10.21236\/ADA131387"},{"key":"16_CR23","unstructured":"Muthukrishnan, S.: Nonuniform sparse approximation with haar wavelet basis. DIMACS TR:2004-42 (2004)"},{"issue":"2","key":"16_CR24","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B.K. Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. on Comput.\u00a024(2), 227\u2013234 (1995)","journal-title":"SIAM J. on Comput."},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","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. Applied and Computational Harmonic Analysis\u00a026(3), 301\u2013322 (2009)","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"16_CR26","unstructured":"Neylon, T.: Sparse solutions for linear prediction problems. PhD thesis, New York University, New York, New York (2006)"},{"key":"16_CR27","unstructured":"Pothen, A.: Sparse null bases and marriage theorems. PhD thesis, Cornell University, Ithica, New York (1984)"},{"issue":"4","key":"16_CR28","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01449770","volume":"64","author":"E. Schmidt","year":"1907","unstructured":"Schmidt, E.: Zur thoerie der linearen und nichtlinearen integralgleichungen, i. Math. Annalen.\u00a064(4), 433\u2013476 (1906-1907)","journal-title":"Math. Annalen."},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Singhal, S.: Amplitude optimization and pitch predictin in multi-pulse coders. IEEE Transactions on Acoustics, Speech and Signal Processing 37(3) (March 1989)","DOI":"10.1109\/29.21700"},{"key":"16_CR30","first-page":"911","volume-title":"Proc. 17th International Conf. on Machine Learning","author":"A. Smola","year":"2000","unstructured":"Smola, A., Sch\u00f6lkopf, B.: Sparse greedy matrix approximation for machine learning. In: Proc. 17th International Conf. on Machine Learning, pp. 911\u2013918. Morgan Kaufmann, San Francisco (2000)"},{"issue":"1","key":"16_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s102080010029","volume":"3","author":"V. Temlyakov","year":"2003","unstructured":"Temlyakov, V.: Nonlinear methods of approximation. Foundations of Comp. Math.\u00a03(1), 33\u2013107 (2003)","journal-title":"Foundations of Comp. Math."},{"issue":"10","key":"16_CR32","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J.A. Tropp","year":"2004","unstructured":"Tropp, J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory\u00a050(10), 2231\u20132242 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"16_CR33","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"50","author":"J.A. Tropp","year":"2006","unstructured":"Tropp, J.A.: Just relax: convex programming methods for subset selection and sparse approximation. IEEE Transactions on Information Theory\u00a050(3), 1030\u20131051 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"16_CR34","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TIT.2004.839492","volume":"51","author":"J.A. Tropp","year":"2006","unstructured":"Tropp, J.A.: Recovery of short, complex linear combinations via \u21131 minimization. IEEE Trans. Inform. Theory\u00a051(1), 188\u2013209 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR35","doi-asserted-by":"publisher","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. Amer. Math. Monthly\u00a0111, 525\u2013526 (2004)","journal-title":"Amer. Math. Monthly"},{"key":"16_CR36","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), pp. 3\u201314 (2005)","DOI":"10.1109\/IDEAS.2005.35"},{"key":"16_CR37","doi-asserted-by":"publisher","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. Journal of Computational Physics\u00a0211, 572\u2013595 (2006)","journal-title":"Journal of Computational Physics"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15369-3_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T11:41:58Z","timestamp":1636285318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}