
An Introduction to Online Computation
Kurzinformation



inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar

Beschreibung
This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity. von Komm, Dennis
Produktdetails

So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
Dr. Dennis Komm is a lecturer in the Chair of Information Technology and Education at ETH Zürich. His research interests include approximation algorithms for hard optimization problems, re-optimization of optimization problems, and advice complexity in different setups and environments.
- paperback
- 656 Seiten
- Erschienen 1998
- CRC Press
- Hardcover
- 756 Seiten
- Erschienen 2011
- Cambridge University Press
- paperback
- 296 Seiten
- Erschienen 2008
- Springer
- hardcover
- 404 Seiten
- Erschienen 2005
- Springer
- Hardcover
- 799 Seiten
- Erschienen 2014
- Pearson Studium
- Kartoniert
- 1078 Seiten
- Erschienen 2001
- Springer
- paperback
- 420 Seiten
- Erschienen 2013
- Springer
- hardcover
- 275 Seiten
- Erschienen 2013
- Springer