Pith. sign in

REVIEW

A parallel approximation algorithm for mixed packing and covering semidefinite programs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1201.6090 v1 pith:5M33E4WJ submitted 2012-01-29 cs.DS cs.DC

Rahul Jain , Penghui Yao This is my paper · ORCID
classification cs.DScs.DC
keywords programsalgorithmapproximationsemidefiniteparallelclassconsideredcovering
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools