License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2021.40
URN: urn:nbn:de:0030-drops-146216
Go to the corresponding LIPIcs Volume Portal

Dvořák, Zdeněk ; Lahiri, Abhiruk

Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs

LIPIcs-ESA-2021-40.pdf (0.6 MB)


We give polynomial-time approximation schemes for monotone maximization problems expressible in terms of distances (up to a fixed upper bound) and efficiently solvable on graphs of bounded treewidth. These schemes apply in all fractionally treewidth-fragile graph classes, a property which 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.

BibTeX - Entry

  author =	{Dvo\v{r}\'{a}k, Zden\v{e}k and Lahiri, Abhiruk},
  title =	{{Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs}},
  booktitle =	{29th Annual European Symposium on Algorithms (ESA 2021)},
  pages =	{40:1--40:10},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-204-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{204},
  editor =	{Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-146216},
  doi =		{10.4230/LIPIcs.ESA.2021.40},
  annote =	{Keywords: approximation, sublinear separators}

Keywords: approximation, sublinear separators
Collection: 29th Annual European Symposium on Algorithms (ESA 2021)
Issue Date: 2021
Date of publication: 31.08.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI