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
BenchAudit – Auditing LLM benchmarks for leaks, data reuse, and harness gaps
0Hacker News New
Guillotine DJ – Announcement Trailer
0Hacker News New
Researchers hijack Hugging Face account for popular Kokoro AI model
0Hacker News New
Automated LLM Fine-Tuning: GPU Selection, Dataset Analysis and Feedback
0Hacker News New
Human-written Launch HN posts get more upvotes than AI-generated ones
0Hacker News New

Parallels Desktop review
0TechRadar