PTAS for Planar TSP: Klein's Framework for Approximation Schemes - Professor Christian Sommer- Alogrithem - Lectures 14 of 23 - Video-lecture

Video-lecture, Algorithms

Description: The lecture is about Algorithm. In this lecture Professor Christian Sommer tells ud about the subprogram in Euclid's algorithm to compute the remainder would execute much faster if the programmer had a "modulus" (division) instruction available rather than just subtraction (or worse: just Minsky's "decrement"). Lecture14 of 23
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome