Lecture: General dynamic program

Loading...
Ver programa

Revisiones

4.7 (132 calificaciones)
  • 5 stars
    78%
  • 4 stars
    19%
  • 3 stars
    2%
  • 2 stars
    1%
ZW

Sep 17, 2017

This course is awesome. Prof. managed to elaborate the problem and analysis clearly and homework is properly assigned.

SN

Jun 27, 2016

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

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.