1
Learning-Augmented Algorithms for Online Vertex Cover
把预测引入在线顶点覆盖，突破传统竞争比瓶颈，理论计算机新进展。
arXiv:2606.22831v1 Announce Type: cross Abstract: This paper studies learning-augmented online weighted vertex cover with advice and a parameter $\lam…
2
Fair Online Resource Allocation
研究公平在线资源分配问题，应用于难民安置与航班调度，提出最大化整体福利的在线模型
arXiv:2606.18679v1 Announce Type: cross Abstract: We study the problem of fair online resource allocation, motivated by applications such as refugee r…
3
Towards Optimal Robustness in Learning-Augmented Paging
探索学习增强分页算法如何实现最优鲁棒性，理论突破值得关注
arXiv:2606.01342v1 Announce Type: cross Abstract: Learning-augmented paging has been extensively studied in recent years. A key advantage over naive M…
4
Truthful Online Preference Aggregation for LLM Fine-Tuning in Mobile Crowdsourcing
提出在线偏好聚合方法，用于移动众包中LLM微调，解决真实性问题。
arXiv:2605.24052v1 Announce Type: cross Abstract: To better serve users' demands in mobile applications (e.g., navigation), mobile crowdsourcing platf…