Semidefinite programs and association schemes

DOI10.1007/s006070050038zbMath0956.90029OpenAlexW2076447282MaRDI QIDQ1969297

Franz Rendl, Michel X. Goemans

Publication date: 22 June 2000

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s006070050038

zbMATH Keywords

association schememax-cut problemsemidefinite programsmaximum cut problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Linear programming (90C05) Association schemes, strongly regular graphs (05E30)

Related Items (8)

Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem ⋮ New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph ⋮ Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra ⋮ Optimal distortion embeddings of distance regular graphs into Euclidean spaces ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ Semidefinite programming and eigenvalue bounds for the graph partition problem

This page was built for publication: Semidefinite programs and association schemes