Introduction to the theory of complexity and approximation algorithms
From MaRDI portal
Publication:4571886
DOI10.1007/BFb0053011zbMath1401.68077OpenAlexW1510838331WikidataQ56387953 ScholiaQ56387953MaRDI QIDQ4571886
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
The generalized definitions of the two-dimensional largest common substructure problems ⋮ Polynomial-time approximation of largest simplices in \(V\)-polytopes.
This page was built for publication: Introduction to the theory of complexity and approximation algorithms
