We may earn an affiliate commission when you visit our partners.

Algorithmics for Hard Problems

Juraj Hromkovič

Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com municated to students and practitioners.

Read this on Amazon

Available editions

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

Hardcover

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Juraj Hromkovic (2002-11-19)

Hardcover

$$$

Save this book

Save Algorithmics for Hard Problems to your list so you can find it easily later:

Save

Help others find this book page by sharing it with your friends and followers:

Facebook

Copy Link

Length: 548 pages

Share and help others discover this book.

Facebook

Link

Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.