Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Texts in Theoretical Computer Science. An EATCS Series - Juraj Hromkovic - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540441342 - October 9, 2002
In case cover and title do not match, the title is correct

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

Price
£ 83.99

Ordered from remote warehouse

Expected delivery Jan 12 - 21, 2026
Christmas presents can be returned until 31 January
Add to your iMusic wish list
or

Also available as:

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  

More by Juraj Hromkovic

Show all