Dual parameterization and parameterized approximability of subset graph problems

DOI10.1051/ro/2016018zbMath1362.68290MaRDI QIDQ2969972

Vangelis Th. Paschos, Édouard Bonnet

Publication date: 24 March 2017

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2d9a6cec33bc8c0af3a92fa6e3c3d8c2e0151667

zbMATH Keywords

polynomial approximation; subset problems; parameterized approximation

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68W25: Approximation algorithms

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)