Improved Approximation for Non-preemptive Scheduling via Time-indexed LP Relaxations
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=zM6k6HDLlN8
Shi Li, SUNY Buffalo
https://simons.berkeley.edu/talks/shi-li-09-15-17
Discrete Optimization via Continuous Relaxation
Other Videos By Simons Institute for the Theory of Computing
Tags:
Shi Li
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Discrete Optimization via Continuous Relaxation