14 citations · 15 across the 4 of their papers we have counts for
4 papers · 1 filter
Scheduling with a Limited Testing Budget
Christoph Damerius, Peter Kling, Minming Li +2
Scheduling with testing falls under the umbrella of the research on optimization with explorable uncertainty. In this model, each job has an upper limit on its processing time that…
Online Dynamic Acknowledgement with Learned Predictions
Sungjin Im, Benjamin Moseley, Chenyang Xu +1
We revisit the online dynamic acknowledgment problem. In the problem, a sequence of requests arrive over time to be acknowledged, and all outstanding requests can be satisfied simu…
Polylogarithmic Approximation for Robust s-t Path
Shi Li, Chenyang Xu, Ruilong Zhang
The paper revisits the robust - path problem, one of the most fundamental problems in robust optimization. In the problem, we are given a directed graph with vertices and…
Using Predicted Weights for Ad Delivery
Thomas Lavastida, Benjamin Moseley, R. Ravi +1
We study the performance of a proportional weights algorithm for online capacitated bipartite matching modeling the delivery of impression ads. The algorithm uses predictions on th…