Approximative Algorithmen und Nichtapproximierbarkeit
From MaRDI portal
Recommendations
- Complexity and approximation. Combinatorial optimization problems and their approximability properties. Incl. 1 CD-ROM
- scientific article; zbMATH DE number 2167361
- Approximation algorithms. An introduction.
- Inapproximability of combinatorial optimization problems
- scientific article; zbMATH DE number 3902037
Cited in
(2)
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)