• Corpus ID: 6267695

# A Lasserre-based $(1+\varepsilon)$-approximation for $Pm \mid p_j=1, \textrm{prec} \mid C_{\max}$

@article{Levey2015AL,
title={A Lasserre-based \$(1+\varepsilon)\$-approximation for \$Pm \mid p\_j=1, \textrm\{prec\} \mid C\_\{\max\}\$},
author={Elaine Levey and Thomas Rothvoss},
journal={ArXiv},
year={2015},
volume={abs/1509.07808}
}
• Published 25 September 2015
• Computer Science
• ArXiv
In a classical problem in scheduling, one has $n$ unit size jobs with a precedence order and the goal is to find a schedule of those jobs on $m$ identical machines as to minimize the makespan. It is one of the remaining four open problems from the book of Garey & Johnson whether or not this problem is $\mathbf{NP}$-hard for $m=3$. We prove that for any fixed $\varepsilon$ and $m$, a Sherali-Adams / Lasserre lift of the time-index LP with a slightly super poly-logarithmic number of \$r = (\log(n…
5 Citations

## Figures from this paper

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
J. Sched.
• 2018
It is shown that many problems can be $$\mathcal {NP}$$NP-hard when considering general precedence constraints, while they become polynomially solvable for particular precedence constraints.
Random Matrices and the Sum-of-Squares Hierarchy
This dissertation presents three results which make modest progress towards understanding the power and limitations of the Sum-of-Squares Hierarchy; all three works use average-case problems as a lens for theSum-of theSquares algorithms, by enabling us to userandom matrix theory as a tool in the analysis.
Semidefinite and linear programming integrality gaps for scheduling identical machines
• Computer Science
IPCO
• 2016
Lower bounds are provided for these hierarchies when applied over the configuration LP for the problem of scheduling identical machines to minimize the makespan.
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
• Computer Science, Mathematics
STOC
• 2016
This work gives an algorithm with running time nearly linear in the input size that approximately recovers a planted sparse vector with up to constant relative sparsity in a random subspace of ℝn of dimension up to Ω(√n).
Research Statement 1 past and Ongoing Work 1.1 Sdps and Hierarchies for Sparsest Cut
In approximation algorithms, I am interested in the use of Linear Programming and Semidefinite Programming relaxations and hierarchies in approximating solutions to NP-hard problems.