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 Graph Partitioning

Development of approximation algorithms for balanced graph partitioning, bisection, and multi-way cut problems.