8 citations · 11 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
Online Matching with Convex Delay Costs
Xingwu Liu, Zhida Pan, Yuyi Wang +1
We investigate the problem of Min-cost Perfect Matching with Delays (MPMD) in which requests are pairwise matched in an online fashion with the objective to minimize the sum of spa…
cs.DS2020
Target Location Problem for Multi-commodity Flow
Xingwu Liu, Zhida Pan, Yuyi Wang
Motivated by scheduling in Geo-distributed data analysis, we propose a target location problem for multi-commodity flow (LoMuF for short). Given commodities to be sent from their r…
cs.DS2018
An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling
Xin Han, Liang Zhao, Zhishan Guo +1
Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for decidi…