Approximating values and solutions of NP-optimization problems: concepts and examples

MaRDI QIDQ3070856zbMATH OpenFDO

Authors Marc Demange, José María Lorenzo

Publication date 28 January 2011

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Completeness in approximation classes
• scientific article; zbMATH DE number 17535
• Structure in Approximation Classes
• scientific article; zbMATH DE number 847149
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation

Cited in

(3)

• On estimation algorithms vs approximation algorithms
• scientific article; zbMATH DE number 847149 (Why is no real title available?)
• Approximate solution of NP optimization problems

This page was built for publication: Approximating values and solutions of NP-optimization problems: concepts and examples

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