A Fast Random Sampling Algorithm for Sparsifying Matrices

Sanjeev Arora, Elad Hazan, Satyen Kale. A Fast Random Sampling Algorithm for Sparsifying Matrices. In Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Compu. Volume 4110 of Lecture Notes in Computer Science, pages 272-279, Springer, 2006. [doi]

@inproceedings{AroraHK06,
  title = {A Fast Random Sampling Algorithm for Sparsifying Matrices},
  author = {Sanjeev Arora and Elad Hazan and Satyen Kale},
  year = {2006},
  doi = {10.1007/11830924_26},
  url = {http://dx.doi.org/10.1007/11830924_26},
  researchr = {https://researchr.org/publication/AroraHK06},
  cites = {0},
  citedby = {0},
  pages = {272-279},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Compu},
  editor = {Josep Díaz and Klaus Jansen and José D. P. Rolim and Uri Zwick},
  volume = {4110},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-38044-2},
}