YoVDO

Sparse Integer Programming Is FPT

Offered By: Hausdorff Center for Mathematics via YouTube

Tags

Integer Programming Courses Parameterized Complexity Courses

Course Description

Overview

Explore a 35-minute lecture on sparse integer programming and its fixed-parameter tractability, presented by Shmuel Onn at the Hausdorff Center for Mathematics. Delve into the culmination of extensive research, examining linear and separable convex objectives in variable dimensions. Discover the far-reaching implications of this result as a powerful tool in parameterized complexity. Learn about related concepts such as tree depth, n-fold and tree-fold integer programming, and multistage stochastic integer programming. Gain insights into the progression of research in this field and its potential applications.

Syllabus

Intro
Outline
Sparse Integer Programming
Tree Depth
Related Earlier and Latest Results
n-Fold and Tree-Fold Integer Programming
Multistage Stochastic Integer Programming


Taught by

Hausdorff Center for Mathematics

Related Courses

A Parameterized Approximation Scheme for Min k-Cut
IEEE via YouTube Parameterized Complexity of Quantum Invariants of Knots
Applied Algebraic Topology Network via YouTube Recent Hardness of Approximation Results in Parameterized Complexity
Hausdorff Center for Mathematics via YouTube Parametrized Algorithms and Possible Future Directions
Hausdorff Center for Mathematics via YouTube Introduction to Parameterized Algorithms and Applications
Hausdorff Center for Mathematics via YouTube