NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Submodular Optimization and Greedy Algorithms

Investigates approximation guarantees for maximizing and minimizing submodular functions using greedy and other polynomial-time approaches.