A parallel approximation algorithm for mixed packing and covering semidefinite programs

Details A parallel approximation algorithm for mixed packing and covering semidefinite programs A parallel approximation algorithm for mixed packing and covering semidefinite programs

2012-01-29

arxiv.org/abs/1201.6090v1

Computer Science

Data Structures and Algorithms

8 pages, version 1

Scientific paper

We present a parallel approximation algorithm for a class of mixed packing and covering semidefinite programs which generalize on the class of positive semidefinite programs as considered by Jain and Yao [2011]. As a corollary we get a faster approximation algorithm for positive semidefinite programs with better dependence of the parallel running time on the approximation factor, as compared to that of Jain and Yao [2011]. Our algorithm and analysis is on similar lines as that of Young [2001] who considered analogous linear programs.

Affiliated with

Also associated with

No associations

Rating

A parallel approximation algorithm for mixed packing and covering semidefinite programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A parallel approximation algorithm for mixed packing and covering semidefinite programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A parallel approximation algorithm for mixed packing and covering semidefinite programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358884