arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.07546math.CO
收藏

参数拟阵ℓ-阻断问题

The Parametric Matroid $\ell$-Interdiction Problem

Nils Hausbrandt, Stefan Ruzika

AI总结:

该研究提出参数拟阵ℓ-阻断问题,证明随参数变化的最关键阻断元素组变化次数为多项式级,并开发出在多项式时间独立性测试下运行时间为多项式级的精确求解算法。

摘要:

本文提出参数拟阵ℓ-阻断问题,其中ℓ∈ℕ>0为允许阻断的固定元素数量。拟阵基集的每个元素都被赋予一个权重,该权重线性依赖于给定区间内的一个实参数。研究目标是针对每个可能的参数值,计算一组ℓ个最关键元素及其对应的目标值——删除这组元素会使最小基的权重产生最大增幅。本文证明,随参数变化的上述元素组的变化次数仅为多项式级。研究者还开发了若干精确算法求解该问题,若独立性测试可在多项式时间内完成,这些算法的运行时间为多项式级。

英文摘要:

In this article, we introduce the parametric matroid $\ell$-interdiction problem, where $\ell\in\mathbb{N}_{>0}$ is a fixed number of elements allowed to be interdicted. Each element of the matroid's ground set is assigned a weight that depends linearly on a real parameter from a given interval. The goal is to compute, for each possible parameter value, a set of $\ell$-most vital elements with corresponding objective value the deletion of which causes a maximum increase of the weight of a minimal basis. We show that such a set, which of course depends on the parameter, can only change polynomially often if the parameter varies. We develop several exact algorithms to solve the problem that have polynomial running times if an independence test can be performed in polynomial time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑