Video From 15w5118: Approximation Algorithms and Parameterized Complexity
Wednesday, December 2, 2015 09:32 - 09:58
Lower bounds on the running time for packing and scheduling problems
![](http://www.birs.ca/files/images/poster.png)
©2024 Banff International Research Station for Mathematical Innovation and Discovery. All Rights Reserved.