Relaxation and matrix randomized rounding for the maximum spectral subgraph problem

DOI10.1007/978-3-030-04651-4_8OpenAlexW2901398359MaRDI QIDQ2327107

Cristina Bazgan, Eric Gourdin, Paul Beaujean

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_8

zbMATH Keywords

semidefinite programmingapproximation algorithmrandom graphsspectral graph theoryrelaxation and rounding

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Relaxation and matrix randomized rounding for the maximum spectral subgraph problem