activity
20142019
most citedNon-monotone DR-submodular Maximization: Approximation and Regret Guarantees

4 citations · 4 across the 4 of their papers we have counts for

collaborators

5 papers

cs.LG2019

Online Non-Monotone DR-submodular Maximization

Nguyen Kim Thang, Abhinav Srivastav

In this paper, we study fundamental problems of maximizing DR-submodular continuous functions that have real-world applications in the domain of machine learning, economics, operat…

cs.LG2019★ 4 cited

Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees

Christoph Dürr, Nguyen Kim Thang, Abhinav Srivastav +1

Diminishing-returns (DR) submodular optimization is an important field with many real-world applications in machine learning, economics and communication systems. It captures a sub…

cs.DS2018

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines

Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang +2

In this paper, we consider the online problem of scheduling independent jobs \emph{non-preemptively} so as to minimize the weighted flow-time on a set of unrelated machines. There…

cs.DS2018

Online Non-preemptive Scheduling on Unrelated Machines with Rejections

Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang +2

When a computer system schedules jobs there is typically a significant cost associated with preempting a job during execution. This cost can be from the expensive task of saving th…

cs.DS2014

Total stretch minimization on single and identical parallel machines

Abhinav Srivastav, Denis Trystram

We consider the classical problem of scheduling jobs with release dates on both single and identical parallel machines. We measure the quality of service provided to each job b…