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 Jobs

Design of approximation algorithms for complex scheduling problems including preemption, precedence constraints, and objective optimization.