AI & ML
Beyond 4: Improved Competitive Traveling Repairperson
arXiv cs.MA0 views
arXiv:2611.21943v1 Announce Type: cross Abstract: With $k\geq 1$ repairpersons starting initially from a depot, we present a 3.877-competitive deterministic algorithm for the fundamental online traveling repairperson problem on an arbitrary metric. For the special class of zero-residual instances, we improve the ratio to $3+\epsilon$ for every $\epsilon>0$. We also extend these results to some variants of the related so-called online dial-a-ride problem. The state-of-the-art is the 4-competitive deterministic algorithm for both problems.
Source:https://arxiv.org/abs/2611.21943PreviousCorrupting Ties: Investigating Robustness to Bias Injection Across Multi-Agent Network TopologiesNextThe Only Edge Was Memorized in Training: LLM Trading Agents Around Earnings and Bad News
Related posts
Classified communications network at the National Security Agency goes down, defense official says
0Phys.org Tech
Le Groupe Figaro and OpenAI partner to bring Le Figaro journalism to ChatGPT
0OpenAI Blog
Web 上已经有 GPT-6.2,本地 Codex 却没有?先对入口,再更新客户端
0dev.to
영지식 증명 프라이버시와 규제 준수: 우리는 정말 두 마리 토끼를 다 잡을 수 있을까?
0dev.to
My context grew 6x in three months. That decides the cache question
0dev.to AI
How to connect Joist to any MCP client: Claude, ChatGPT, Cursor
0dev.to AI