An approximation algorithm for the maximum spectral subgraph problem.
Cristina BazganPaul BeaujeanÉric GourdinPublished in: J. Comb. Optim. (2022)
Keyphrases
- preprocessing
- experimental evaluation
- high accuracy
- worst case
- approximation ratio
- detection algorithm
- optimal solution
- learning algorithm
- optimization algorithm
- segmentation algorithm
- linear programming
- np hard
- computational complexity
- computational cost
- cost function
- matching algorithm
- genetic algorithm
- k means
- objective function
- convex hull
- recognition algorithm
- spectral analysis
- polynomial time approximation
- maximum matching
- spectral decomposition