{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:28:31Z","timestamp":1773275311715,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540380443","type":"print"},{"value":"9783540380450","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_26","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T12:33:54Z","timestamp":1156509234000},"page":"272-279","source":"Crossref","is-referenced-by-count":34,"title":["A Fast Random Sampling Algorithm for Sparsifying Matrices"],"prefix":"10.1007","author":[{"given":"Sanjeev","family":"Arora","sequence":"first","affiliation":[]},{"given":"Elad","family":"Hazan","sequence":"additional","affiliation":[]},{"given":"Satyen","family":"Kale","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Hazan, E., Kale, S.: Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In: 46th FOCS, pp. 339\u2013348 (2005)","DOI":"10.1109\/SFCS.2005.35"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., McSherry, F.: Fast computation of low rank matrix approximations. In: 32nd STOC, pp. 611\u2013618 (2001)","DOI":"10.1145\/380752.380858"},{"issue":"1-3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P. Drineas","year":"2004","unstructured":"Drineas, P., Frieze, A.M., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Machine Learning\u00a056(1-3), 9\u201333 (2004)","journal-title":"Machine Learning"},{"key":"26_CR4","unstructured":"Drineas, P., Kannan, R.: Pass efficient algorithms for approximating large matrices. In: SODA, pp. 223\u2013232 (2003)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_30","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P. Drineas","year":"2006","unstructured":"Drineas, P., Mahoney, M., Muthukrishnan, S.: Column-based relative-error. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, Springer, Heidelberg (2006)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Deshpande","year":"2006","unstructured":"Deshpande, A., Vempala, S.: Adaptive sampling and fast low-rank matrix approximation. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, Springer, Heidelberg (2006)"},{"issue":"6","key":"26_CR7","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1145\/1039488.1039494","volume":"51","author":"A.M. Frieze","year":"2004","unstructured":"Frieze, A.M., Kannan, R., Vempala, S.: Fast monte-carlo algorithms for finding low-rank approximations. J. ACM\u00a051(6), 1025\u20131041 (2004)","journal-title":"J. ACM"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/rsa.20089","volume":"27","author":"U. Feige","year":"2005","unstructured":"Feige, U., Ofek, E.: Spectral techniques applied to sparse random graphs. Random Structures and Algorithms\u00a027(2), 251\u2013275 (2005)","journal-title":"Random Structures and Algorithms"},{"issue":"301","key":"26_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058(301), 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"26_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"26_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"L.N. Trefethen","year":"1997","unstructured":"Trefethen, L.N., Bau, D.: Numerical Linear Algebra. SIAM, Philadelphia (1997)"}],"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\/11830924_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:37Z","timestamp":1619507617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11830924_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}