参数化拟阵截集问题
Parametric Matroid Interdiction
AI总结:
本研究提出参数化拟阵单元素截集问题,推导了衡量问题复杂度的分段线性函数斜率变化次数的多项式上下界,据此设计了需多项式次独立性测试的算法并分析其在图拟阵下的运行时间。
摘要:
我们提出参数化拟阵单元素截集问题。给定一个拟阵,其基础集合的每个元素都对应一个权重,该权重与给定参数区间内的实参数呈线性相关。研究目标是针对每个参数值,找到一个移除后能让最小权基的权重最大化的元素。该问题的复杂度可通过分段线性函数的斜率变化次数来衡量,该函数将参数映射到参数化拟阵单元素截集问题的最优解权重。我们给出了该斜率变化次数的两个多项式上界以及一个下界。基于这些结果,我们开发了仅需多项式次独立性测试的算法,并分析了其在图拟阵这一特殊情形下的运行时间。
英文摘要:
We introduce the parametric matroid one-interdiction problem. Given a matroid, each element of its ground set is associated with a weight that depends linearly on a real parameter from a given parameter interval. The goal is to find, for each parameter value, one element that, when being removed, maximizes the weight of a minimum weight basis. The complexity of this problem can be measured by the number of slope changes of the piecewise linear function mapping the parameter to the weight of the optimal solution of the parametric matroid one-interdiction problem. We provide two polynomial upper bounds as well as a lower bound on the number of these slope changes. Using these, we develop algorithms that require a polynomial number of independence tests and analyse their running time in the special case of graphical matroids.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。