
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 Softcover reprint of hardcover 2nd ed. 2003 edition
Juraj Hromkovic
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Texts in Theoretical Computer Science. An EATCS Series Softcover reprint of hardcover 2nd ed. 2003 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.
551 pages, 19 black & white illustrations, biography
Media | Books Paperback Book (Book with soft cover and glued back) |
Released | December 9, 2010 |
ISBN13 | 9783642079092 |
Publishers | Springer-Verlag Berlin and Heidelberg Gm |
Pages | 538 |
Dimensions | 237 × 166 × 30 mm · 771 g |
Language | German |
Show all
More by Juraj Hromkovic
See all of Juraj Hromkovic ( e.g. Paperback Book and Hardcover Book )