COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 861333 (Why is no real title available?)
- Approximate solution of NP optimization problems
- Completeness in approximation classes
- Differential approximation algorithms for some combinatorial optimization problems
- Differential approximation for optimal satisfiability and related problems
- Differential approximation results for the traveling salesman and related problems
- Local search, reducibility and approximability of NP-optimization problems
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- On Syntactic versus Computational Views of Approximability
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- On approximation scheme preserving reducibility and its applications
- Optimization, approximation, and complexity classes
- Structure in Approximation Classes
- Structure preserving reductions among convex optimization problems
- z-approximations
Cited in
(9)- Mathematical Foundations of Computer Science 2003
- A survey on the structure of approximation classes
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- Data reductions and combinatorial bounds for improved approximation algorithms
- Algorithms and Computation
- A 3/4 differential approximation algorithm for traveling salesman problem
- A 3/4 differential approximation algorithm for traveling salesman problem
- Completeness theorem for singular differential pencils
- Completeness in approximation classes beyond APX
This page was built for publication: COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714673)
