Introduction to the theory of complexity and approximation algorithms

DOI10.1007/BFb0053011zbMath1401.68077OpenAlexW1510838331WikidataQ56387953 ScholiaQ56387953MaRDI QIDQ4571886

Thomas Jansen

Publication date: 3 July 2018

Published in: Lectures on Proof Verification and Approximation Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0053011

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

The generalized definitions of the two-dimensional largest common substructure problems, Polynomial-time approximation of largest simplices in \(V\)-polytopes.