Pages that link to "Item:Q5002735"
From MaRDI portal
The following pages link to Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735):
Displaying 6 items.
- Server cloud scheduling (Q2085746) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- Server cloud scheduling (Q6130327) (← links)
- A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams (Q6162034) (← links)
