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 Temporal Problems

Develops approximation algorithms for time-dependent optimization including temporal scheduling and time-varying routing.