Rico Zenklusen: Approximation algorithms for hard augmentation problems, lecture I

(1:11:40)

Rico Zenklusen: A 1.5-approximation for path TSP

(1:16:7)

Rico Zenklusen: The Submodular Secretary Problem Goes Linear

(30:13)

Rico Zenklusen: Approximation algorithms for hard augmentation problems, lecture II

(1:19:46)

Rico Zenklusen, Vera Traub: Bridging the Gap Between Tree and Connectivity Augmentation

(1:57)

Rico Zenklusen: An O(1)-approximation for minimum spanning tree interdiction

(50:31)

Rico Zenklusen: Approximation algorithms for hard augmentation problems, lecture III

(1:17:54)

A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming

(31:35)

ISCO 2022 - Plenary talk by Rico Zenklusen

(57:31)

Mathematical Way to Choose a Toilet - Numberphile

(7:49)

Spanische Informatiker finden Arbeit im Wallis | Galicien - Schweiz einfach | Reportage | SRF

(22:4)

17. Complexity: Approximation Algorithms

(1:21:8)

Ali, Iman, Peyman, Mohammad: 2-Approximation for Prize-Collecting Steiner Forest.

(44:13)

Matroid Secretary Problem by Sourav Chakraborty

(34:32)

Zeev Nutov: On LP-relaxations for the tree augmentation problem

(32:53)

An improved approximation algorithm for ATSP

(49:3)

Online Node-weighted Steiner Forest and Extensions

(1:3:28)

STOC 2021 - Bridging the Gap Between Tree and Connectivity Augmentation

(25:12)

STOC 2021 - Near-Linear Time Approximation Schemes for Steiner Tree and Forest in Low-Dim Spaces

(24:15)

STOC 2023 - Session 10B - A (1.5+epsilon)-Approx Algorithm for Weighted Connectivity Augmentation.

(24:47)

Session 1A – Talk 1

(19:55)

Rico Zenklusen - Florin Gheorghiu | Sicilian Defense: Lasker-Pelikan Variation | 2006

(1:9)

Zenklusen, Rico VS Mohrenstecher, Juergen

(40)

Better-Than-2 Approximations for Weighted Tree Augmentation - Vera Traub (ETH Zürich)

(1:46)

A Simple O(loglog(rank))-Competitive Algorithm for the Matroid Secretary Problem

(49:37)

Invited Talk: Better-Than-2 Approximations for Weighted Tree Augmentation

(1:11:15)