Publication
Tracking Idea Flows between Social Groups
Video
A Lasserre-Based (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints
In a classical problem in scheduling, one has n unit size jobs with a precedence order and the goal is to find a schedule of those jobs on m identical machines as to minimize the…
Publication
On the Team Selection Problem
Video
Deeparnab Chakrabarty: Provable Submodular Function Minimization via Fujishige Wolfe Algorithm
The Fujishige-Wolfe heuristic is empirically one of the fastest algorithms for Submodular Function Minimization and is based upon Wolfe’s algorithm to find the nearest point on a polytope to the origin. There was no theoretical…
Publication