Previous | Next --- Slide 8 of 32
Back to Lecture Thumbnails

One common way to approximate discrete optimization problems is to relax them into continuous problems and then round the results.


@HelloWorld Yes, absolutely. And this is in fact an interesting approach to analysis of algorithms more broadly: find a continuous approximation, and sometimes you will find that problems that are formally hard can nonetheless be approximated reasonably well.