NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Approximation Algorithms for Maximum Cut Problems

Study of approximation algorithms using spectral methods, semidefinite programming, and other techniques for maximum cut variants.