Algorithm Design Complexity

Research Frontiers in Submodular Optimization and Greedy Analysis

Development of efficient algorithms for maximizing submodular functions with performance guarantees relevant to machine learning and combinatorial optimization.

All Algorithm Design & Complexity PhD categories