Implications of forbidden structures for extremal algorithmic problems
We develop and analyze P-optimal approximation algorithms for various generalized satisfiability problems and determine the corresponding P- optimal thresholds. The most novel aspect of the paper is that we develop new P-optimal algorithms for restricted generalized satisfiability problems which are defined by forbidden subformulas. All our algorithms run in linear time on a RAM.
scientific article; zbMATH DE number 3974290
scientific article