Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem.
Cristina BazganPaul BeaujeanÉric GourdinPublished in: COCOA (2018)
Keyphrases
- spectral relaxation
- linear programming relaxation
- integrality gap
- tight upper and lower bounds
- singular value decomposition
- approximation algorithms
- semidefinite
- laplacian matrix
- singular values
- matrix representation
- spectral analysis
- knapsack problem
- spectral clustering
- mixed integer
- spectral methods
- linear programming
- spectral decomposition
- lognormal distribution
- np hard
- search space
- maximum number
- clustering algorithm
- integer programming
- hyperspectral imagery
- decision forest
- probabilistic relaxation
- upper bound