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

固定维度下的短回路步长

Short circuit walks in fixed dimension

Bowdoin College(鲍登学院);ETH Zurich(苏黎世联邦理工学院)

Alexander E. Black, Christian Nöbel, Raphael Steiner

AI总结:

本研究强化了线性规划中最短单调回路步逼近问题的难解性结论,证明固定维度下m边多边形的O(m^{1-ε})因子逼近是NP难的,且该结果接近最优。

摘要:

回路增广方案是一类用于线性规划的组合算法,是对单纯形法的推广。为求解线性规划问题,这类方法会构造所谓的单调回路步:从可行域的一个初始顶点出发,沿着边界遍历离散的点序列,过程中沿某些允许的方向(回路)移动,且每一步都优化目标函数,直至达到最优解。由于短回路步的存在性已被提出猜想(回路直径猜想),已有多项研究探讨了人们能以多高的效率逼近通向最优解的最短单调回路步。De Loera、Kafer和Sanità[SIAM J. Opt., 2022]给出了针对该问题的首个结果,他们证明,以一个线性规划(LP)和起始顶点作为输入,求解该问题的2-近似解是NP难的。Cardinal与第三作者[Math. Prog. 2023]在指数时间假设下给出了更强的下界,证明对于由m个不等式定义的线性规划,即便近似因子为O(log m / log log m)的求解也是难解的。这两项结果均基于对组合优化中高维的高度退化多胞形的归约。\n在本文中,我们显著强化了上述 hardness 结果,证明对于任意固定的ε>0,在有m条边的多边形上以O(m^{1-ε})的因子逼近该问题是NP难的。该结果本质上是最优的,无法改进到o(m)以内。特别地,这一结论意味着该问题在简单多胞形以及固定维度下均具有难解性。

英文摘要:

Circuit augmentation schemes are a family of combinatorial algorithms for linear programming that generalize the simplex method. To solve the linear program, they construct a so-called monotone circuit walk: They start at an initial vertex of the feasible region and traverse a discrete sequence of points on the boundary, while moving along certain allowed directions (circuits) and improving the objective function at each step until reaching an optimum. Since the existence of short circuit walks has been conjectured (Circuit Diameter Conjecture), several works have investigated how well one can efficiently approximate shortest monotone circuit walks towards an optimum. A first result addressing this question was given by De Loera, Kafer, and Sanità [SIAM J. Opt., 2022], who showed that given as input an LP and the starting vertex, finding a $2$-approximation for this problem is NP-hard. Cardinal and the third author [Math. Prog. 2023] gave a stronger lower bound assuming the exponential time hypothesis, showing that even an approximation factor of $O(\frac{\log m}{\log \log m})$ is intractable for LPs defined by $m$ inequalities. Both of these results were based on reductions from highly degenerate polytopes in combinatorial optimization with high dimension. In this paper, we significantly strengthen the aforementioned hardness results by showing that for every fixed $\varepsilon>0$ approximating the problem on polygons with $m$ edges to within a factor of $O(m^{1-\varepsilon})$ is NP-hard. This result is essentially best-possible, as it cannot be improved beyond $o(m)$. In particular, this implies hardness for simple polytopes and in fixed dimension.

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

↑