Pages that link to "Item:Q4268884"

The following pages link to How Good is the Goemans--Williamson MAX CUT Algorithm? (Q4268884):

Displaying 12 items.

• Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
• Affine reductions for LPs and SDPs (Q1717229) (← links)
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters (Q1791705) (← links)
• On the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs (Q2115142) (← links)
• Eigenvalues of Cayley graphs (Q2138565) (← links)
• Some observations on the smallest adjacency eigenvalue of a graph (Q2295999) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• The maximum cut problem on blow-ups of multiprojective spaces (Q2435039) (← links)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
• Cuts for mixed 0-1 conic programming (Q2571004) (← links)
• (Q5500595) (← links)