PulseAugur
中
实时 08:31:59
English(EN) Beyond 4: Improved Competitive Traveling Repairperson

新算法提高了旅行维修工问题的竞争比

研究人员为在线旅行维修工问题开发了一种新的确定性算法,在任意度量下实现了3.877的竞争比。这改进了之前最先进的4竞争算法。对于称为零残差实例的特定实例子集,新算法实现了任何ε > 0的3+ε比率。这项工作还将这些发现扩展到在线叫车问题的某些变体。 AI

影响 在复杂路由问题的算法效率方面引入了理论进步。

排序理由 详细介绍算法改进的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.MA (Multiagent) 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

新算法提高了旅行维修工问题的竞争比

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
详细介绍算法改进的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
Standard
On-topic for AI-industry coverage; kept in the public index.
Story freshness
1 days old
Coverage has settled into its steady-state source set.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv cs.MA (Multiagent) TIER_1 English(EN) · Gokarna Sharma ·

    超越4:改进的竞争性旅行维修工

    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+ε$ f…