Approximation Algorithms and Semidefinite Programming
Bernd Gärtner
评分 暂无
Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety o
