what is the best book to gain an introductory understanding of approximation algorithms? I'm looking for something along the lines of the Sedgewick, that has examples written in a well known language and not psuedocode.

  • 3
    $\begingroup$ Approximation algorithms is a theoretical topic. When it comes to practice, one uses heuristic algorithms. $\endgroup$ Feb 15 '15 at 2:38
  • $\begingroup$ Best is too subjective. Subjective questions are not a good fit for this site; see cs.stackexchange.com/help/dont-ask. What are your criteria? And what research have you done? We expect you to do a significant amount of research before asking, and to show your research in the question. $\endgroup$
    – D.W.
    Feb 15 '15 at 5:18
  • 2
    $\begingroup$ Try Vazirani's book, or Williamson-Shmoys. $\endgroup$
    – Juho
    Feb 15 '15 at 7:56
  • $\begingroup$ Most books on approximation algorithms are designed for people who work in theory. Cormen leiserson rivest and Stein's introduction to algorithms' sections on approximation algorithms may be useful, but they use pseudocode. $\endgroup$
    – Batman
    Feb 15 '15 at 15:16