Differential approximation for optimal satisfiability and related problems

Differential approximation for optimal satisfiability and related problems

0.00 Avg rating0 Votes
Article ID: iaor20042758
Country: Netherlands
Volume: 147
Issue: 2
Start Page Number: 397
End Page Number: 404
Publication Date: Jun 2003
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

We study the differential approximability of several optimization satisfiability problems. We prove that, unless co-RP=NP, MIN SAT is not differential 1/m1-ϵ-approximable for any ϵ>0, where m is the number of clauses. We also prove that any differential approximation algorithm for MAX minimal vertex cover can be transformed into a differential approximation algorithm for MIN kSAT achieving the same differential performance ratio. This leads us to study the differential approximability of MAX minimal vertex cover and MIN independent dominating set. Both of them are equivalent for the differential approximation. For these problems we prove a strong inapproximability result, informally, unless P=NP, any approximation algorithm has worst-case approximation ratio equal to 0.

Reviews

Required fields are marked *. Your email address will not be published.