跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24201 · v1

A (12/11+eps)-Approximation for Nonpreemptive Throughput Maximization

首次提交 2026-11-18 18:38
版本更新 2026-11-18 18:38
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

We study unweighted nonpreemptive throughput maximization on an arbitrary number of identical machines: each job has a processing time and a release--deadline window, and the goal is to schedule as many jobs as possible. For every fixed ε>0\varepsilon>0, we give a randomized (12/11+ε)(12/11+\varepsilon)-approximation. This improves the recent (4/3+ε)(4/3+\varepsilon)-approximation of Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, and Andreas Wiese and the (17/13+ε)(17/13+\varepsilon)-approximation of Tong and Xu. For binary-encoded integral inputs, our algorithm runs in time nOε(1)poly⁡(N)n^{O_\varepsilon(1)}\operatorname{poly}(N), where NN is the input length.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 18:38 · 最新观测版本

A (12/11+eps)-Approximation for Nonpreemptive Throughput Maximization

We study unweighted nonpreemptive throughput maximization on an arbitrary number of identical machines: each job has a processing time and a release--deadline window, and the goal is to schedule as many jobs as possible. For every fixed ε>0\varepsilon>0, we give a randomized (12/11+ε)(12/11+\varepsilon)-approximation. This improves the recent (4/3+ε)(4/3+\varepsilon)-approximation of Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, and Andreas Wiese and the (17/13+ε)(17/13+\varepsilon)-approximation of Tong and Xu. For binary-encoded integral inputs, our algorithm runs in time nOε(1)poly⁡(N)n^{O_\varepsilon(1)}\operatorname{poly}(N), where NN is the input length.

查看此版本解读 →查看此版本原文 ↗