Approximation metatheorem for fractionally treewidth-fragile graphs

03/15/2021 ∙ by Zdeněk Dvořák, et al. ∙ 0

Baker's technique is a powerful tool for designing polynomial-time approximation schemes, in particular for all optimization problems expressible in monotone first-order logic. However, it can only be used in rather restricted graph classes. We show that maximization problems expressible in monotone first-order logic admit PTAS under a much weaker assumption of fractional treewidth-fragility, and QPTAS on all hereditary classes with sublinear separators.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.