← 研踪 PaperTrailarXiv:2611.26602 · v1
An Efficient Algorithm for Matroid Cups
拟阵杯问题的一个高效算法
首次提交 2026-11-20 02:54
版本更新 2026-11-20 02:54
雷达观测 2026-11-20 12:52
摘要
We design a polynomial-time algorithm for matroid cups with discrepancy. Our matroid cups algorithm design consists of a sequence of reductions to simpler instances, culminating in instances of matroid cups where the matroid has rank 1.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-20 02:54 · 最新观测版本
An Efficient Algorithm for Matroid Cups
We design a polynomial-time algorithm for matroid cups with discrepancy. Our matroid cups algorithm design consists of a sequence of reductions to simpler instances, culminating in instances of matroid cups where the matroid has rank 1.
查看此版本解读 →查看此版本原文 ↗