A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints using LP Hierarchies · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1509.07808/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTA (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints using LP Hierarchies — mentioned by NotOscarWildehttps://news.ycombinator.com/item?id=10785469urn:hackerpapers:mention:1509.07808:10785469Wed, 23 Dec 2015 20:30:13 GMT<p>Elaine Levey, Thomas Rothvoss - A Lasserre-based (1+ε)-approximation for Pm∣pj=1,prec∣Cmax http://arxiv.org/abs/1509.07808 People are very excited about graph isomorphism being solvable in quasipolynomial time, but there are a few more problems from the seminal Garey, Johnson book that are still unknown to be in either P or NP-c or neither. One of them is computing the optimal schedule for three machines processing some tasks (jobs), when the tasks have all the same size, but there are dependencies among some of them and you have to do them in order. This paper proves that there is a…</p><p><a href="https://hackerpaper.kaipfister.de/p/1509.07808/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS