Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Approximation Algorithms for LCS and LIS with Truly Improved Running Times

IEEE via YouTube

Overview

Explore cutting-edge research on approximation algorithms for Longest Common Subsequence (LCS) and Longest Increasing Subsequence (LIS) problems in this 18-minute IEEE conference talk. Delve into the latest advancements presented by researchers Aviad Rubinstein, Saeed Seddighin, Zhao Song, and Xiaorui Sun as they discuss innovative approaches to improve running times for these fundamental computational problems. Gain insights into the theoretical and practical implications of their work, which has the potential to enhance efficiency in various applications of sequence analysis and dynamic programming.

Syllabus

Approximation Algorithms for LCS and LIS with Truly Improved Running Times

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Approximation Algorithms for LCS and LIS with Truly Improved Running Times

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.