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 Scheduling on Unrelated Machines

Study of approximation algorithms for job scheduling on heterogeneous machines with various objective functions and constraints.