Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem

Cristina Bazgan, Paul Beaujean, Éric Gourdin. Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem. In Donghyun Kim 0001, R. N. Uma, Alexander Zelikovsky, editors, Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings. Volume 11346 of Lecture Notes in Computer Science, pages 108-122, Springer, 2018. [doi]

Abstract

Abstract is missing.