NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Submodular Function Optimization and Greedy Analysis

Study of approximation guarantees for greedy algorithms applied to submodular maximization and minimization problems.