Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs
Data Structures and Algorithms
2021-05-06 v1 Discrete Mathematics
Combinatorics
Abstract
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.
Cite
@article{arxiv.2105.01780,
title = {Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs},
author = {Zdeněk Dvořák and Abhiruk Lahiri},
journal= {arXiv preprint arXiv:2105.01780},
year = {2021}
}
Comments
14 pages, no figures