Structure of polynomial-time approximation
From MaRDI portal
Publication:692893
DOI10.1007/s00224-011-9366-zzbMath1288.68083MaRDI QIDQ692893
Erik Jan van Leeuwen, Jan van Leeuwen
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9366-z
NP-optimization problems; efficient computation; EPTAS; approximation-preserving reductions; asymptotic polynomial-time approximation schemes; polynomial-time approximation schemes; structure of complexity classes
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)