A (1+epsilon)-approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies
964 views · Published 14 September 2017 · 54:31 · Indexed 21 September 2026
Channel: Simons Institute for the Theory of Computing · 2017 · Education
Thomas Rothvoß, University of Washington https://simons.berkeley.edu/talks/thomas-rothvoss-9-14-17 Discrete Optimization via Continuous Relaxation
More from this channel
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
33:14
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
-
23:27
Which Regular Expression Patterns are Hard to Match?
-
1:03:10
Decay of Correlations in Spin Systems
-
34:02
Modelling Gene Expression Dynamics with Gaussian Processes
-
37:26
Telomere Length, Nature and Nurture
-
31:01
Simple Models and Exact Algorithms for Computing Network Modules