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 with Constraints

Investigates approximation guarantees for scheduling with machine constraints, precedence relations, and complex objective functions.