Pages that link to "Item:Q2196315"
From MaRDI portal
The following pages link to Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315):
Displaying 4 items.
- 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)
- (Q2293097) (redirect page) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time (Q6589758) (← links)
