AI seminar: Optimal simulation of interruptible anytime algorithms using contract algorithms
Speaker: Alex Lopez-Ortiz
Consider the scenario of routing of a Fedex delivery van. The packages to be delivered are received by midnight and delivery starts at 7:00am. This means we have seven hours to compute the best possible approximation to the optimum Travelling Salesman Path computable in that time.