Lectures on proof verification and approximation algorithms

DOI10.1007/BFB0053010MaRDI QIDQ1388145zbMATH OpenOpenAlexFDO

Authors

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

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) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(9)

• On the approximation of the minimum disturbance \(p\)-facility location problem
• Verified Approximation Algorithms
• scientific article; zbMATH DE number 1304339 (Why is no real title available?)
• Partial digest is hard to solve for erroneous input data
• Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
• Deterministic and randomized polynomial‐time approximation of radii
• Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
• Data science applications to string theory
• Approximation algorithms for the TSP with sharpened triangle inequality

This page was built for publication: Lectures on proof verification and approximation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388145)