ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1702.08415
  4. Cited By
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification

An SDP-Based Algorithm for Linear-Sized Spectral Sparsification

27 February 2017
Y. Lee
He Sun
ArXivPDFHTML

Papers citing "An SDP-Based Algorithm for Linear-Sized Spectral Sparsification"

4 / 4 papers shown
Title
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and
  Faster Positive SDP Solver
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver
Zeyuan Allen-Zhu
Y. Lee
L. Orecchia
54
72
0
08 Jul 2015
Spectral Sparsification and Regret Minimization Beyond Matrix
  Multiplicative Updates
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
Zeyuan Allen-Zhu
Zhenyu A. Liao
L. Orecchia
124
89
0
16 Jun 2015
Uniform Sampling for Matrix Approximation
Uniform Sampling for Matrix Approximation
Michael B. Cohen
Y. Lee
Cameron Musco
Christopher Musco
Richard Peng
Aaron Sidford
57
219
0
21 Aug 2014
Faster and Simpler Width-Independent Parallel Algorithms for Positive
  Semidefinite Programming
Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming
Richard Peng
Kanat Tangwongsan
Peng Zhang
109
44
0
24 Jan 2012
1