Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)

  1. home
  2. Books
  3. Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)

3.92 6 0
Share:

Read Online:

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)

loader

Join now to keep reading!

Your preview has ended! Become a member today to continue reading for Free!

Reading
%

About Author

Juraj Hromkovic

Juraj Hromkovic

3.78 55 6
View All Books