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

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]

@inproceedings{LeveyR16,
  title = {A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies},
  author = {Elaine Levey and Thomas Rothvoss},
  year = {2016},
  doi = {10.1145/2897518.2897532},
  url = {http://doi.acm.org/10.1145/2897518.2897532},
  researchr = {https://researchr.org/publication/LeveyR16},
  cites = {0},
  citedby = {0},
  pages = {168-177},
  booktitle = {Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016},
  editor = {Daniel Wichs and Yishay Mansour},
  publisher = {ACM},
  isbn = {978-1-4503-4132-5},
}