Approximation Algorithms for LCS and LIS with Truly Improved Running Times
Offered By: IEEE via YouTube
Course Description
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
Tags
Related Courses
Approximation Algorithms Part IÉcole normale supérieure via Coursera Approximation Algorithms Part II
École normale supérieure via Coursera Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera Algorithm Design and Analysis
University of Pennsylvania via edX Delivery Problem
University of California, San Diego via Coursera