Publication:5136270

DOI10.4230/LIPIcs.ISAAC.2017.50zbMath1457.68126MaRDI QIDQ5136270

Vangelis Th. Paschos, Michael Lampis, Ioannis Katsikarelis

Publication date: 25 November 2020

zbMATH Keywords

approximation; treewidth; domination; clique-width; FPT algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C12: Distance in graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms

68Q27: Parameterized complexity, tractability and kernelization