Polylog-Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs

preview_player
Показать описание
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
  1. APPROX 2020
Рекомендации по теме
Polylog-Approximation Algorithm for 0:22:05

Polylog-Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs

Surviving in Directed 0:28:28

Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation...

STOC 2021 - 0:24:15

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

TCS+ talk: Thatchaphol 0:58:40

TCS+ talk: Thatchaphol Saranurak

Pankaj Agarwal:Deterministic, Near-Linear 0:47:41

Pankaj Agarwal:Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching...

Euclidean Steiner Tree 0:01:19

Euclidean Steiner Tree Question in Approximation Algorithms

Polynomial Kernel for 0:29:50

Polynomial Kernel for Chordal Vertex Deletion

ESA.8.3 Kruskal based 0:18:39

ESA.8.3 Kruskal based approximation algorithm for the multi level Steiner tree problem

Better-Than-2 Approximations for 1:00:46

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

Parinya Chalermsook. Vertex 0:51:58

Parinya Chalermsook. Vertex Sparsification for Edge Connectivity

STOC 2020 - 0:53:31

STOC 2020 - Session 2A: Dynamic Algorithms

Mik Zlatin: New 0:41:34

Mik Zlatin: New and Improved Algorithms for Steiner Tree Augmentation Problems

Settling the Pass 1:45:57

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams 1hr 45m Assadi

Session 3A - 0:21:39

Session 3A - Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

Settling the Pass 1:01:02

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams 1hr

LP Rounding for 0:32:19

LP Rounding for Poise

17May26 Tutte's 100th 0:54:56

17May26 Tutte's 100th

Day Zero: Hopsets 0:39:01

Day Zero: Hopsets and Spanners for Combinatorial Graph Algorithms

Ola Svensson: Polyhedral 0:39:25

Ola Svensson: Polyhedral Techniques in Combinatorial Optimization: Matchings and Tours

Hardness for Dynamic 1:00:15

Hardness for Dynamic Problems; Conclusion and Future Research

TCS+ Talk: Clifford 1:14:35

TCS+ Talk: Clifford Stein

Let’s Try and 0:59:05

Let’s Try and Be More Tolerant: On Tolerant Property Testing and Distance Approximation

Laszlo Babai: Symmetry 0:52:38

Laszlo Babai: Symmetry versus Regularity II

Algorithms 1:00:20

Algorithms