A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Elaine Levey, Thomas Rothvoss. A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 168-177, ACM, 2016. [doi]

This author has not been identified. Look up 'Elaine Levey' in GoogleThis author has not been identified. Look up 'Thomas Rothvoss' in Google

runs on WebDSL