Improved Approximations for Hard Optimization Problems via Problem Instance Classification
Open access
Date
2011Type
- Monograph
ETH Bibliography
yes
Altmetrics
Permanent link
https://doi.org/10.3929/ethz-a-010887447Publication status
publishedExternal links
Search print copy at ETH Library
Publisher
ETH-ZürichSubject
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)Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science
Notes
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.More
Show all metadata
ETH Bibliography
yes
Altmetrics