Lecture: General dynamic program

Loading...
Ver programa

Revisiones

4.7 (127 calificaciones)
  • 5 stars
    98 ratings
  • 4 stars
    25 ratings
  • 3 stars
    3 ratings
  • 2 stars
    1 ratings
SN

Jun 27, 2016

This was a relatively easy but well paced introduction to approximation algorithms. I totally enjoyed it.

NB

Feb 05, 2016

A useful course which introduces key ideas in Approximation Algorithms. Looking forward to part II.

De la lección
Knapsack and Rounding
This module shows the power of rounding by using it to design a near-optimal solution to another basic problem: the Knapsack problem.

Impartido por:

  • Claire Mathieu

    Claire Mathieu

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.