Optimization problems with approximation schemes

DOI10.1007/3-540-63172-0_47MaRDI QIDQ4362925zbMATH OpenFDO

Authors A. Malmström

Publication date 13 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63172-0_47

zbMATH Keywords

fully polynomial-time approximation schememetafinite model theoryNP optimization

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 515727
• Structure of polynomial-time approximation
• scientific article; zbMATH DE number 3850828
• Approximate solution of NP optimization problems

Cited in

(9)

• Optimization. Algorithms and consistent approximations
• Improving the complexities of approximation algorithms for optimization problems
• scientific article; zbMATH DE number 3850828 (Why is no real title available?)
• Some optimization problems with extremal operations
• Two logical hierarchies of optimization problems over the real numbers
• scientific article; zbMATH DE number 4083400 (Why is no real title available?)
• scientific article; zbMATH DE number 1786295 (Why is no real title available?)
• Approximation Classes for Real Number Optimization Problems
• Approximate solution of NP optimization problems

This page was built for publication: Optimization problems with approximation schemes

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