Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
Yutong Geng, Enze Sun, Zonghan Yang +1
This paper studies the online scheduling problem of minimizing total flow time for jobs on identical machines. A classical lower bound shows that no deterministic si…
cs.DS2025
Edge-weighted Matching in the Dark
Zhiyi Huang, Enze Sun, Xiaowei Wu +1
We present a -competitive Quadratic Ranking algorithm for the Oblivious Bipartite Matching problem, a distribution-free version of Query-Commit Matching. This result breaks…