43 citations · 181 across the 50 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 33 cited
Provable Submodular Minimization using Wolfe's Algorithm
Deeparnab Chakrabarty, Prateek Jain, Pravesh Kothari
Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained S…
cs.DS2014
On -Restricted Assignment Makespan Minimization
Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li
Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time -approximation algorithm is known for the problem for consta…