Approximation Algorithms in Perl

Presented by Walt Mankowski

Abstract

Your boss has given you a new assignment. Remembering back to that intro to programming course you took back in college, you realize that he's asked you to solve is NP complete. People smarter that you have been working on this since before you were born and haven't been able to come with any good solutions, so chances are you won't, either. So what do you do? It turns out that many NP complete problems have approximate solutions that are surprisingly close to optimal. Even better, many of them are really easy to code. This talk begin with a brief introduction to NP completeness, then show several simple approximate solutions to famous NP complete problems.

Details

Time: 10:45 AM
Length: 30 minutes
Room: pair Networks