Baker game and polynomial-time approximation schemes

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10416992" target="_blank" >RIV/00216208:11320/20:10416992 - isvavai.cz</a>

Result on the web

<a href="https://dl.acm.org/doi/10.5555/3381089.3381226" target="_blank" >https://dl.acm.org/doi/10.5555/3381089.3381226</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Baker game and polynomial-time approximation schemes

Original language description

Baker [1] 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&apos;s technique and the minor structure theorem, Dawar et al. [5] 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&apos;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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA17-04611S" target="_blank" >GA17-04611S: Ramsey-like aspects of graph coloring</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA&apos;20)

ISBN

978-1-61197-599-4

ISSN

—

e-ISSN

—

Number of pages

14

Pages from-to

2227-2240

Publisher name

ASSOC COMPUTING MACHINERY

Place of publication

NEW YORK

Event location

Salt Lake City

Event date

Jan 5, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000554408102018