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. 1201.5135
  4. Cited By
Faster and Simpler Width-Independent Parallel Algorithms for Positive
  Semidefinite Programming

Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming

24 January 2012
Richard Peng
Kanat Tangwongsan
Peng Zhang
ArXivPDFHTML

Papers citing "Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming"

2 / 2 papers shown
Title
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification
Y. Lee
He Sun
35
85
0
27 Feb 2017
A parallel approximation algorithm for mixed packing and covering
  semidefinite programs
A parallel approximation algorithm for mixed packing and covering semidefinite programs
Rahul Jain
Penghui Yao
62
14
0
29 Jan 2012
1