Birs- 15w5118: Approximation Algorithms and Parameterized Complexity
-
Title: Fixed-Parameter Tractability and Approximability: A Survey of Connections
Speaker:
Link:
-
Title: Complexity and Approximability of Parameterized CSP
Speaker:
Link:
-
Title: FPT approximation schemes for Shift Bribery
Speaker:
Link:
-
Title: Balanced Optimization with vector costs
Speaker:
Link:
-
Title: A brief introduction to kernelization
Speaker:
Link:
-
Title: Using Parameterization to Move Approximation into Problem Legislation
Speaker:
Link:
-
Title: Estimating The Makespan of The Two-Valued Restricted Assignment Problem
Speaker:
Link:
-
Title: A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem
Speaker:
Link:
-
Title: Lower bounds on the running time for packing and scheduling problems
Speaker:
Link:
-
Title: A Fully Polynomial (3/2 + ∈)-Approximation for Scheduling Monotone Moldable Jobs
Speaker:
Link:
-
Title: An O(log m)-Competitive Algorithm for Online Machine Minimization
Speaker:
Link:
-
Title: Packing group items
Speaker:
Link:
-
Title: Improved Approximation Algorithm for Minimum Feedback Vertex Sets in Tournaments
Speaker:
Link:
-
Title: Fully Dynamic Bin Packing Revisited
Speaker:
Link:
-
Title: Maximum Spanning k-Tree: A Case Study
Speaker:
Link:
-
Title: The FPT wiki
Speaker:
Link:
-
Title: Multi-Clique-Width, a Powerful New Width Parameter
Speaker:
Link:
-
Title: On Temporal Graph Exploration
Speaker:
Link: