On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

preview_player
Показать описание

  1. APPROX 2020
Рекомендации по теме
On the Parameterized 0:21:22

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

FPT In-Approximability - 0:50:39

FPT In-Approximability - I | Karthik C. S. | Parameterized Complexity Workshop

STOC 2023 - 0:29:13

STOC 2023 - Session 2C - Parameterized Inapproximability of MDP & SVP

FPT Approximation - 1:05:59

FPT Approximation - I | Meirav Zehavi | Parameterized Complexity Workshop

D2.A — Parameterized 0:26:13

D2.A — Parameterized inapproximability for Steiner Orientation by gap amplification

FPT In-Approximability - 0:45:34

FPT In-Approximability - III | Karthik C. S. | Parameterized Complexity Workshop

The Constant Inapproximability 0:19:17

The Constant Inapproximability of the Parameterized Dominating set Problem

Andreas Feldmann: The 0:29:35

Andreas Feldmann: The Parameterized Complexity of the Survivable Network Design Problem

STOC 2023 - 0:26:49

STOC 2023 - Session 2C - An Improved Parameterized Algorithm for Treewidth.

Parameterized Approximation Schemes 0:19:41

Parameterized Approximation Schemes

FPT In-Approximability - 0:57:27

FPT In-Approximability - II | Karthik C. S. | Parameterized Complexity Workshop

Parameterized Inapproximability of 0:29:47

Parameterized Inapproximability of Max k-Subset Intersection under ETH

Parameterized Inapproximability for 0:56:38

Parameterized Inapproximability for Steiner Orientation by Gap Amplification

Vincent Cohen-Added: On 1:01:59

Vincent Cohen-Added: On the Parameterized Complexity of Various Clustering Problems

[Scheduling seminar] Dvir 1:22:33

[Scheduling seminar] Dvir Shabtay (Ben-Gurion Uni) | On the Parameterized Complexity of Machine...

STACS 2021 | 0:29:45

STACS 2021 | Exploiting Dense Structures in Parameterized Complexity

On the Parameterized 1:00:51

On the Parameterized Complexity of Clustering (Vincent Cohen-Addad)

Daniel Lokshtanov: A 1:04:14

Daniel Lokshtanov: A Parameterized Approximation Scheme for k-Min Cut

Approximation and Fixed 0:26:50

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs

When approximation fails, 0:13:42

When approximation fails, try parameterized approximation by Anannya Upasana

FPT Approximation - 1:05:58

FPT Approximation - II | Meirav Zehavi | Parameterized Complexity Workshop

Kernels - I 1:05:06

Kernels - I | Roohani Sharma | Parameterized Complexity Workshop

Augmenting Flows | 1:14:41

Augmenting Flows | Marcin Pilipczuk | Parameterized Complexity Workshop

Karthik C. S.: 0:56:51

Karthik C. S.: Recent Hardness of Approximation results in Parameterized Complexity