Pages that link to "Item:Q3596346"
From MaRDI portal
The following pages link to Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring (Q3596346):
Displaying 4 items.
- Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← links)
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)