Unlocking Efficient Scheduling Solutions: Insights from Dvir Shabtay on Parameterized Complexity 📅
Join Ben-Gurion University's Dvir Shabtay as he explores how parameterized complexity can tackle NP-hard scheduling problems, offering new avenues for algorithmic optimization and fixed-parameter tractability.
Scheduling seminar
380 views • Jan 20, 2022
About this video
Keywords: Scheduling, NP-hard, Fixed parameterized tractability (FPT), Algorithmic design, Optimization
The main goal of parameterized complexity is to try to design algorithms that are capable of solving (in reasonable time) hard problems in cases where some predefined problem parameters are of limited size. This theory was developed in the early 90s, contributing to many new techniques in the area of algorithmic design ever since. In this talk we survey the main aspects of parametrized complexity, and highlight its applicability to the area of scheduling. We also discuss some challenges and open problems for future research.
Organized by Zdenek Hanzalek (CTU in Prague), Michael Pinedo (New York University), and Guohua Wan (Shanghai Jiao Tong).
Seminar's webpage: https://schedulingseminar.com/
The main goal of parameterized complexity is to try to design algorithms that are capable of solving (in reasonable time) hard problems in cases where some predefined problem parameters are of limited size. This theory was developed in the early 90s, contributing to many new techniques in the area of algorithmic design ever since. In this talk we survey the main aspects of parametrized complexity, and highlight its applicability to the area of scheduling. We also discuss some challenges and open problems for future research.
Organized by Zdenek Hanzalek (CTU in Prague), Michael Pinedo (New York University), and Guohua Wan (Shanghai Jiao Tong).
Seminar's webpage: https://schedulingseminar.com/
Video Information
Views
380
Likes
10
Duration
01:22:33
Published
Jan 20, 2022