Improved Approximations for Hard Optimization Problems via Problem Instance Classification

Open access
Datum
2011Typ
- Monograph
ETH Bibliographie
yes
Altmetrics
Persistenter Link
https://doi.org/10.3929/ethz-a-010887447Publikationsstatus
publishedExterne Links
Printexemplar via ETH-Bibliothek suchen
Verlag
ETH-ZürichThema
DISKRETE OPTIMIERUNG (OPERATIONS RESEARCH); ALLGEMEINE BETRACHTUNGEN ZUR ALGORITHMENTHEORIE (MATHEMATIK); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); DISCRETE PROGRAMMING (OPERATIONS RESEARCH); GENERAL CONSIDERATIONS OF THE THEORY OF ALGORITHMS (MATHEMATICS); ALGORITHMIC COMPLEXITY (MATHEMATICS)Organisationseinheit
02150 - Dep. Informatik / Dep. of Computer Science
Anmerkungen
Rainbow of Computer Science. Essays Dedicated to Hermann Maurer on the Occasion of His 70th Birthday, LNCS 6570, pp. 3-19, 2011, 978-3-642-19391-0.ETH Bibliographie
yes
Altmetrics