Title of article :
Maximum renamable Horn sub-CNFs Original Research Article
Author/Authors :
Endre Boros، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Abstract :
The NP-hard problem of finding the largest renamable Horn sub-CNF of a given CNF is considered, and a polynomial time approximation algorithm is presented for this problem. It is shown that for cubic CNFs this algorithm has a guaranteed performance ratio of 4067.
Keywords :
Horn CNF , Satisfiability , Approximation algorithms
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
