scholarly journals A Parallel Approximation Algorithm for Positive Semidefinite Programming

2011 ◽  
Author(s):  
Rahul Jain ◽  
Penghui Yao
Keyword(s):  
Approximation Algorithm ◽  
Semidefinite Programming ◽  
Positive Semidefinite ◽  
Parallel Approximation ◽  
Parallel Approximation Algorithm

APPROXIMATING MAXIMUM 2-CNF SATISFIABILITY

1992 ◽  
Vol 02 (02n03) ◽  
pp. 181-187 ◽  
Author(s):  
DAVID J. HAGLIN
Keyword(s):  
Approximation Algorithm ◽  
Satisfiability Problem ◽  
Parallel Time ◽  
Performance Guarantees ◽  
Crew Pram ◽  
Parallel Approximation ◽  
Parallel Approximation Algorithm

A parallel approximation algorithm for the MAXIMUM 2-CNF SATISFIABILITY problem is presented. This algorithm runs in O( log 2(n + |F|)) parallel time on a CREW PRAM machine using O(n + |F|) processors, where n is the number of variables and |F| is the number of clauses. Performance guarantees are considered for three slightly differing definitions of this problem.

Sign in / Sign up

Export Citation Format

Share Document