Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs

05/04/2021
by   Zdeněk Dvořák, et al.
0

We give polynomial-time approximation schemes for monotone maximization problems expressible in terms of distances (up to a fixed upper bound) and efficiently solvable in graphs of bounded treewidth. These schemes apply in all fractionally treewidth-fragile graph classes, a property that is true for many natural graph classes with sublinear separators. We also provide quasipolynomial-time approximation schemes for these problems in all classes with sublinear separators.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2021

Approximation metatheorem for fractionally treewidth-fragile graphs

Baker's technique is a powerful tool for designing polynomial-time appro...
research
01/10/2013

Efficient Approximation for Triangulation of Minimum Treewidth

We present four novel approximation algorithms for finding triangulation...
research
03/13/2023

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs

We investigate a relaxation of the notion of treewidth-fragility, namely...
research
08/31/2017

EPG-representations with small grid-size

In an EPG-representation of a graph G each vertex is represented by a pa...
research
03/02/2018

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

The notion of treewidth, introduced by Robertson and Seymour in their se...
research
07/20/2022

Contraction Bidimensionality of Geometric Intersection Graphs

Given a graph G, we define bcg(G) as the minimum k for which G can be co...
research
12/23/2020

PTAS for Sparse General-Valued CSPs

We study polynomial-time approximation schemes (PTASes) for constraint s...

Please sign up or login with your details

Forgot password? Click here to reset