2 citations · 3 across the 7 of their papers we have counts for
7 papers
Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
Eniko Kevi, Nguyen Kim Thang
Matching problems have been widely studied in the research community, especially Ad-Auctions with many applications ranging from network design to advertising. Following the variou…
Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
Tuan-Anh Nguyen, Nguyen Kim Thang, Denis Trystram
Learning at the edges has become increasingly important as large quantities of data are continually generated locally. Among others, this paradigm requires algorithms that are simp…
Online Decentralized Frank-Wolfe: From theoretical bound to applications in smart-building
Angan Mitra, Nguyen Kim Thang, Tuan-Anh Nguyen +2
The design of decentralized learning algorithms is important in the fast-growing world in which data are distributed over participants with limited local computation resources and…
Online Primal-Dual Algorithms with Predictions for Packing Problems
Nguyen Kim Thang, Christoph Durr
The domain of online algorithms with predictions has been extensively studied for different applications such as scheduling, caching (paging), clustering, ski rental, etc. Recently…
Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach
Eric Angel, Nguyen Kim Thang, Shikha Singh
In this paper, we study the -forest problem in the model of resource augmentation. In the -forest problem, given an edge-weighted graph , a parameter , and a set o…
Lagrangian Duality based Algorithms in Online Scheduling
Nguyen Kim Thang
We consider Lagrangian duality based approaches to design and analyze algorithms for online energy-efficient scheduling. First, we present a primal-dual framework. Our approach mak…