Authors:
- A textbook as well as a handbook on the kernel of current algorithmics
- With many examples to support the understanding
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts in Theoretical Computer Science. An EATCS Series (TTCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (7 chapters)
-
Front Matter
-
Back Matter
About this book
Authors and Affiliations
-
Department of Computer Science, ETH Zürich, ETH Zentrum RZ F2, Swiss Federal Institute of Technology, Zürich, Switzerland
Juraj Hromkovič
Bibliographic Information
Book Title: Algorithmics for Hard Problems
Book Subtitle: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Authors: Juraj Hromkovič
Series Title: Texts in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-3-662-05269-3
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2004
Hardcover ISBN: 978-3-540-44134-2Published: 09 October 2002
Softcover ISBN: 978-3-642-07909-2Published: 09 December 2010
eBook ISBN: 978-3-662-05269-3Published: 14 March 2013
Series ISSN: 1862-4499
Series E-ISSN: 1862-4502
Edition Number: 2
Number of Pages: XIV, 538
Topics: Programming Techniques, Input/Output and Data Communications, Communications Engineering, Networks, Computer Communication Networks, Mathematical Logic and Formal Languages, Computational Mathematics and Numerical Analysis