English(EN) Matroid Algorithms Under Size-Sensitive Independence Oracles

拟阵算法研究大小敏感查询成本，揭示二次界限

作者 PulseAugur 编辑部 · [1 个来源] · 2026-05-04 04:00

研究人员为拟阵算法引入了一种新的成本模型，该模型考虑了查询集的大小，超越了传统的常数时间假设。这种大小敏感的方法能更好地反映实际计算工作量，尤其对于图拟阵等自然拟阵类别。该研究为寻找基和近似秩等基本任务建立了严格的界限，表明最优查询成本通常是拟阵大小的二次方，但最大回路大小较小的拟阵除外。 AI

影响为优化等领域的算法分析引入了更现实的理论模型，可能影响相关领域的未来研究。

排序理由学术论文，介绍新的理论框架和算法结果。

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: Research; 学术论文，介绍新的理论框架和算法结果。
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: 132 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

arXiv cs.LG TIER_1 English(EN) · Kiarash Banihashem, MohammadTaghi Hajiaghayi, Mahdi JafariRaviz, Danny Mittal · 2026-05-04 04:00

Matroid 算法在尺寸敏感独立预言机下

arXiv:2605.00201v1 Announce Type: cross Abstract: The standard oracle model for matroid algorithms assumes that each independence query can be answered in constant time, regardless of the size of the queried set. While this abstraction has underpinned much of the theoretical prog…