3 citations · 8 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2021★ 2 cited
Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications
Ying Cao, Bo Sun, Danny H. K. Tsang
We consider an online version of the well-studied network utility maximization problem, where users arrive one by one and an operator makes irrevocable decisions for each user with…
cs.DS2020
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
Bo Sun, Ali Zeynali, Tongxin Li +3
We introduce and study a general version of the fractional online knapsack problem with multiple knapsacks, heterogeneous constraints on which items can be assigned to which knapsa…
cs.DS2020
Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis
Ying Cao, Bo Sun, Danny H. K. Tsang
We study two canonical online optimization problems under capacity/budget constraints: the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) u…