DeepAI AI Chat
Log In Sign Up

Baker game and polynomial-time approximation schemes

by   Zdeněk Dvořák, et al.

Baker devised a technique to obtain approximation schemes for many optimization problems restricted to planar graphs; her technique was later extended to more general graph classes. In particular, using the Baker's technique and the minor structure theorem, Dawar et al. gave Polynomial-Time Approximation Schemes (PTAS) for all monotone optimization problems expressible in the first-order logic when restricted to a proper minor-closed class of graphs. We define a Baker game formalizing the notion of repeated application of Baker's technique interspersed with vertex removal, prove that monotone optimization problems expressible in the first-order logic admit PTAS when restricted to graph classes in which the Baker game can be won in a constant number of rounds, and prove without use of the minor structure theorem that all proper minor-closed classes of graphs have this property.


page 1

page 2

page 3

page 4


Approximation metatheorem for fractionally treewidth-fragile graphs

Baker's technique is a powerful tool for designing polynomial-time appro...

Minor-closed graph classes with bounded layered pathwidth

We prove that a minor-closed class of graphs has bounded layered pathwid...

Maximum edge colouring problem on graphs that exclude a fixed minor

The maximum edge colouring problem considers the maximum colour assignme...

Testability and local certification of monotone properties in minor-closed classes

The main problem in the area of property testing is to understand which ...

Efficient Approximation Schemes for Stochastic Probing and Prophet Problems

Our main contribution is a general framework to design efficient polynom...

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes

The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (...