29 citations · 50 across the 5 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
Data-driven Competitive Algorithms for Online Knapsack and Set Cover
Ali Zeynali, Bo Sun, Mohammad Hajiesmaili +1
The design of online algorithms has tended to focus on algorithms with worst-case guarantees, e.g., bounds on the competitive ratio. However, it is well-known that such algorithms…
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…