
Tell your friends about this item:
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Texts in Theoretical Computer Science. An EATCS Series 2nd ed. 2003. Corr. 2nd printing 2004 edition
Juraj Hromkovic
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Texts in Theoretical Computer Science. An EATCS Series 2nd ed. 2003. Corr. 2nd printing 2004 edition
Juraj Hromkovic
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies.
538 pages, biography
Media | Books Hardcover Book (Book with hard spine and cover) |
Released | October 9, 2002 |
ISBN13 | 9783540441342 |
Publishers | Springer-Verlag Berlin and Heidelberg Gm |
Pages | 538 |
Dimensions | 155 × 235 × 30 mm · 916 g |
Language | English German |
Show all
More by Juraj Hromkovic
See all of Juraj Hromkovic ( e.g. Paperback Book and Hardcover Book )