Skip to content

Author

Run-Tian Ren

We have 5 of 9 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Paging with Per-Replacement Maximum Delay

Classical paging serves every miss immediately. We study paging with per-replacement maximum delay, where loading a pending page costs one movement plus the age of its oldest outstanding request and clears that page's entire episode. Equivalently, the holding rate is the number of pending pages. For cache size $k$, thr...

Tian-Han Lu, Run-Tian Ren, Sheng-Cai Liu · 0 citations
Preprint Aug 2026

Online Bin Packing with Per-Bin Maximum Delay

This work proves strong NP-hardness and rule out absolute approximation factors below three halves unless P equals NP, and obtains an exact stochastic benchmark for Poisson arrivals when every item has half the bin capacity.

Tian-Han Lu, Run-Tian Ren, Sheng-Cai Liu · 0 citations
Sep 2026

Online Covering with Maximum Delay under Subadditive Service Costs

Online covering in which each instantaneous service pays its purchase cost and one maximum waiting time, with no effect on future requests is studied, finding an offline consecutive-batch normal form that transfers static approximation guarantees to the offline problem.

Tian-Han Lu, Run-Tian Ren, Sheng-Cai Liu · 1 citation
Preprint Aug 2026

Online Multi-Level Aggregation with Per-Batch Maximum Delay

The deterministic guarantee matches the known fixed-node lower bound, and the matching randomized lower bound are proved, ensuring that both guarantees are optimal on every nondegenerate rooted tree.

Tian-Han Lu, Run-Tian Ren, Sheng-Cai Liu et al. · 3 citations
Preprint Aug 2026

Online Service with Per-Batch Maximum Delay

This work uses spatial blindness---announced requests whose locations are revealed only when visited---as a stress test: dyadic exploration preserves a constant ratio on a known finite line, while a single hidden request on a star forces a loss linear in its degree.

Tian-Han Lu, Run-Tian Ren, Sheng-Cai Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.