Fetching the paper…
Reading the bibliography…
This paper studies the problem of finding an $(1+\epsilon)$-approximate solution to positive semidefinite programs.
Fast approximation algorithms for fractional packing and covering problems
Serge A. Plotkin, David B. Shmoys, and E. Tardos · 1991
Earlier work this paper cites.
An Introduction to Parallel Algorithms
Joseph JáJá · 1992
Earlier work this paper cites.
Geometric Algorithms and Combinatorial Optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 1993
Earlier work this paper cites.
A parallel approximation algorithm for positive linear programming
Michael Luby and Noam Nisan · 1993
Earlier work this paper cites.
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
Philip N. Klein and Hsueh-I Lu · 1996
Earlier work this paper cites.
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
N. Garg and J. Konemann · 1998
Earlier work this paper cites.
Approximate nearest neighbors: Towards removing the curse of dimensionality
Piotr Indyk and Rajeev Motwani · 1998
Earlier work this paper cites.
Sequential and parallel algorithms for mixed packing and covering
Neal E. Young · 2001
Earlier work this paper cites.
An elementary proof of a theorem of johnson and lindenstrauss
Sanjoy Dasgupta and Anupam Gupta · 2003
Cited alongside, same era.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Cited alongside, same era.
Fast algorithms for approximate semide.nite programming using the multiplicative weights update method
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2005
Cited alongside, same era.
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora and Satyen Kale · 2007
Cited alongside, same era.
Efficient Algorithms using the Multiplicative Weights Update Method
Satyen Kale · 2007
Cited alongside, same era.
Beating simplex for fractional packing and covering linear programs
Christos Koufogiannakis and Neal E. Young · 2007
Cited alongside, same era.
Approximating semidefinite packing programs
Garud Iyengar, David J. Phillips, and Clifford Stein · 2011
Later among the works it cites.
A parallel approximation algorithm for positive semidefinite programming
Rahul Jain and Penghui Yao · 2011
Later among the works it cites.
A parallel approximation algorithm for mixed packing and covering semidefinite programs
Rahul Jain and Penghui Yao · 2012
Closest in time.
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Richard Peng and Kanat Tangwongsan · 2012
Closest in time.
Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel
Zeyuan Allen-Zhu and Lorenzo Orecchia · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Christos Koufogiannakis and Neal E. Young · 2009
Cited alongside, same era.
Feasible and accurate algorithms for covering semidefinite programs
Garud Iyengar, David J. Phillips, and Clifford Stein · 2010
Cited alongside, same era.
Di Wang, Michael W. Mahoney, Nishanth Mohan, and Satish Rao · 2015
Closest in time.
Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver
Zeyuan Allen Zhu, Yin Tat Lee, and Lorenzo Orecchia · 2015
Closest in time.