Lectures on proof verification and approximation algorithms
From MaRDI portal
Publication:1388145
DOI10.1007/BFb0053010zbMath1043.68579OpenAlexW1527658885MaRDI QIDQ1388145
No author found.
Publication date: 10 June 1998
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0053010
Analysis of algorithms and problem complexity (68Q25) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (7)
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem ⋮ Approximation algorithms for the TSP with sharpened triangle inequality ⋮ On the approximation of the minimum disturbance \(p\)-facility location problem ⋮ Data science applications to string theory ⋮ Deterministic and randomized polynomial‐time approximation of radii ⋮ Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. ⋮ Partial digest is hard to solve for erroneous input data
This page was built for publication: Lectures on proof verification and approximation algorithms
