
Approximation schemes for bounded distance problems on fractionally treewidthfragile graphs
We give polynomialtime approximation schemes for monotone maximization ...
read it

Baker game and polynomialtime approximation schemes
Baker devised a technique to obtain approximation schemes for many optim...
read it

Algorithmic MetaTheorems for Monotone Submodular Maximization
We consider a monotone submodular maximization problem whose constraint ...
read it

TreewidthPliability and PTAS for MaxCSPs
We identify a sufficient condition, treewidthpliability, that gives a p...
read it

AMSNP: a tame fragment of existential secondorder logic
Amalgamation monotone SNP (AMSNP) is a fragment of existential secondor...
read it

On classes of graphs with strongly sublinear separators
For real numbers c,epsilon>0, let G_c,epsilon denote the class of graphs...
read it

PTAS for Sparse GeneralValued CSPs
We study polynomialtime approximation schemes (PTASes) for constraint s...
read it
Approximation metatheorem for fractionally treewidthfragile graphs
Baker's technique is a powerful tool for designing polynomialtime approximation schemes, in particular for all optimization problems expressible in monotone firstorder logic. However, it can only be used in rather restricted graph classes. We show that maximization problems expressible in monotone firstorder logic admit PTAS under a much weaker assumption of fractional treewidthfragility, and QPTAS on all hereditary classes with sublinear separators.
READ FULL TEXT
Comments
There are no comments yet.