39 citations · 40 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Waiting is worth it and can be improved with predictions
Ya-Chun Liang, Meng-Hsi Li, Chung-Shou Liao +1
We revisit the well-known online traveling salesman problem (OLTSP) and its extension, the online dial-a-ride problem (OLDARP). A server starting at a designated origin in a metric…
cs.DS2010★ 39 cited
Online Stochastic Packing Applied to Display Ad Allocation
Jon Feldman, Monika Henzinger, Nitish Korula +2
Inspired by online ad allocation, we study online stochastic packing linear programs from theoretical and practical standpoints. We first present a near-optimal online algorithm fo…