Approximative Algorithmen und Nichtapproximierbarkeit

DOI10.1515/9783110203172zbMATH Open1173.90001OpenAlexW142380753MaRDI QIDQ3499082FDOQ3499082

Klaus Jansen, Marian Margraf

Publication date: 20 May 2008

Full work available at URL: https://doi.org/10.1515/9783110203172

Recommendations

• scientific article; zbMATH DE number 1330033
• scientific article; zbMATH DE number 2167361
• Approximation algorithms. An introduction.
• Inapproximability of combinatorial optimization problems
• scientific article; zbMATH DE number 3902037

zbMATH Keywords

complexitynon-approximabilityoptimisation problemsapproximative algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (2)

• On Pseudodeterministic Approximation Algorithms.
• Nonlinear phenomena in spaces of algorithms

This page was built for publication: Approximative Algorithmen und Nichtapproximierbarkeit

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