组合优化问题的不可逼近性
Inapproximability of Combinatorial Optimization Problems
摘要：
本文综述了关于组合优化问题近似解的困难性的研究结果。
英文摘要：
We survey results on the hardness of approximating combinatorial optimization problems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
基于VC维数推广的真机构的不可逼近性
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
计算机机制设计（AMD）研究计算效率、真实性和最优性之间的微妙相互作用。我们专注于AMD的典型问题：组合拍卖。我们提出了一个新的推广的VC维多值集合的功能，其中包括经典的VC维，Natarajan维，斯蒂尔维。我们提出了一个相应的推广的绍尔-谢拉引理，并利用这个VC机器建立确定性的真实机制的不可逼近的结果。我们的研究结果基本上统一了所有的不可逼近的结果，确定性的真实机制组合拍卖的日期，并建立新的分离之间的差距真实和不真实的算法。
cs.CCcs.DMcs.GT
Combinatorial Optimization via the Sum of Squares Hierarchy
We study the Sum of Squares (SoS) Hierarchy with a view towards combinatorial optimization. We survey the use of the SoS hierarchy to obtain approximation algorithms on graphs using their spectral properties. We present a simplified proof of the result of Feige and Krauthgamer on the performance of the hierarchy for the Maximum Clique problem on random graphs. We also present a result of Guruswami and Sinop that shows how to obtain approximation algorithms for the Minimum Bisection problem on low threshold-rank graphs. We study inapproximability results for the SoS hierarchy for general constr…
cs.CCcs.DS
Definable Inapproximability: New Challenges for Duplicator
We consider the hardness of approximation of optimization problems from the point of view of definability. For many NP-hard optimization problems it is known that, unless P = NP, no polynomial-time algorithm can give an approximate solution guaranteed to be within a fixed constant factor of the optimum. We show, in several such instances and without any complexity theoretic assumption, that no algorithm that is expressible in fixed-point logic with counting (FPC) can compute an approximate solution. Since important algorithmic techniques for approximation algorithms (such as linear or semidefi…
cs.CCcs.LO
最大条带恢复的不可逼近性
Inapproximability of maximal strip recovery
在比较基因组学中，序列分析的第一步通常是将两个或多个基因组分解成同源染色体的同线区段。为了可靠地恢复同线块，需要首先去除基因组图谱中的噪声和模糊性。最大条带恢复（Maximum Strip Recovery，MSR）是Zheng，Zhu和Sankoff提出的一个优化问题，用于在噪声和模糊性中从基因组图谱中可靠地恢复同线块。给定$d$基因组图谱作为基因标记的序列，\msr{d}的目标是找到$d$序列，每个基因组图谱的一个子序列，使得这些序列中同线块的总长度最大化。对于任何常数$d \ge 2$，以前已知\msr{d}的多项式时间2d近似。在本文中，我们表明，对于任何$d \ge 2$，\msr{d}是APX困难的，即使是最基本的版本的问题，其中所有的基因标记是不同的，并出现在每个基因组图谱的正方向。此外，我们提供了第一个明确的下界近似\msr{d}的所有$d \ge 2$。特别是，我们表明，\msr{d}是NP-难近似$Ω(d/\log d)$内。从另一个方向，我们表明，以前的二维近似\msr{d}可以优化成一个多项式时间算法，即使$d$是不是一个常数，但输入的一部分。然后，我们将我们的不可逼近性结果推广到几个相关的问题，包括\cmsr{d}，\gapmsr δ{d}，和\gapcmsr δ{d}。
cs.CC
二元拟阵的Tutte多项式及相关组合多项式的逼近
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
我们考虑某些组合多项式的逼近问题。首先，我们考虑的问题，逼近的Tutte多项式的二元拟阵参数q>= 2和伽玛。（相对于经典的（x，y）参数化，q=（x-1）（y-1）和gamma=y-1。）图是二元拟阵的一种特殊情况，因此作者早期的工作表明，除了平凡的情况gamma=0之外，q>2是不可逼近的（服从某些复杂性假设）。q=2的情况就不同了。图的先前结果暗示在区域-2<=gamma<0中的不可逼近性，除了在两个“特殊点”，其中多项式可以在多项式时间内精确计算。对于二元拟阵，我们通过证明（i）除非NP=RP，否则在区域gamma<-2中不存在FPRAS，以及（ii）在区域gamma>0中，近似问题对于复杂性类#RHPi_1在近似保持（AP）约简下是困难的。后一个结果表明在q=2时近似复杂度的差距：虽然在图形情况下FPRAS是已知的，但在二元拟阵情况下可能没有，除非所有#RHPi_1都有FPRAS。结果还表明，它是计算上难以近似的重量枚举的二进制线性码，除了在特殊的重量，在该问题是完全可解的多项式时间。因此，我们表明，近似置换群的循环指数多项式是很难#RHPi_1 AP-约简下，部分解决了一个问题，我们首先在1992年提出。
cs.CCmath.CO
近似参数化k-Clique的k^{o(1)}下界的简单组合构造
Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
本文提出一种简单的组合框架，通过从(k,k-1)-Gap Clique到(q^k,q^{k-1})-Gap Clique的间隙生成自归约，在W[1]≠FPT假设下证明k-Clique的k^{o(1)}不可近似性，避免了Gap-ETH和复杂代数技术。
cs.CCcs.DMcs.DS
更多相关论文收起更多论文
On the Hardness and Inapproximability of Recognizing Wheeler Graphs
In recent years several compressed indexes based on variants of the Burrows-Wheeler transformation have been introduced. Some of these index structures far more complex than a single string, as was originally done with the FM-index [Ferragina and Manzini, J. ACM 2005]. As such, there has been an effort to better understand under which conditions such an indexing scheme is possible. This led to the introduction of Wheeler graphs [Gagie it et al., Theor. Comput. Sci., 2017]. A Wheeler graph is a directed graph with edge labels which satisfies two simple axioms. Wheeler graphs can be indexed in a…
cs.CC
增强的组合结构生成：近似难度
Reinforced Generation of Combinatorial Structures: Hardness of Approximation
University of California, Berkeley（加州大学伯克利分校）；Google DeepMind（谷歌DeepMind）；Google（谷歌）
利用AI方法在复杂性理论中取得进展，改进MAX-CUT、MAX-3-CUT和TSP的近似难度结果。
cs.AIcs.CCcs.LG
固定结构上组合优化的复杂度分析
On the Complexity of Combinatorial Optimization on Fixed Structures
针对各维度可行子集固定的组合优化问题，分析其复杂度，证明固定结构在特定场景可简化问题但整体仍保持NP完全性，揭示结构约束对组合优化难度的影响规律。
cs.CC
组合优化问题的逼近阈值
Approximation thresholds for combinatorial optimization problems
一个NP难的组合优化问题$Π$被称为有一个{ \em近似阈值}，如果存在某个$t$，使得$Π$的最优值可以在多项式时间内在$t$的比率内近似，并且在比$t$更好的比率内近似它是NP难的。我们调查了一些已知的近似阈值的结果，并讨论了从已知的结果出现的模式。
cs.CC
Maxmin $k$-Cut 重构的渐近最优不可近似性
Asymptotically Optimal Inapproximability of Maxmin $k$-Cut Reconfiguration
本文证明 Maxmin $k$-Cut 重构问题的最优近似因子为 $1 - \Theta(1/k)$，并给出 PSPACE-困难性下界与多项式时间算法上界。
cs.CCcs.DMcs.DS
通过分析形状（曲率）的变化来识别关键网络边
On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
University of Illinois Chicago（伊利诺伊大学芝加哥分校）
本文提出利用Ollivier-Ricci曲率研究无向图中关键边的算法与复杂性问题，揭示了与二分图完美匹配及组合打包/覆盖问题的关联。
cs.CCcs.DS
Computational Models based on Synchronized Oscillators for Solving Combinatorial Optimization Problems
The equivalence between the natural minimization of energy in a dynamical system and the minimization of an objective function characterizing a combinatorial optimization problem offers a promising approach to designing dynamical system-inspired computational models and solvers for such problems. For instance, the ground state energy of coupled electronic oscillators, under second harmonic injection, can be directly mapped to the optimal solution of the Maximum Cut problem. However, prior work has focused on a limited set of such problems. Therefore, in this work, we formulate computing models…
cs.CCmath.OC
组合优化中的Grothendieck型不等式
Grothendieck-type inequalities in combinatorial optimization
我们调查的Grothendieck不等式和它的变种，组合优化和计算复杂性的连接。
cs.CCcs.DSmath.CO
花型装配中的组合优化
Combinatorial Optimization in Pattern Assembly
图案自组装瓦片集综合（Pattern self-assembled tile set synthesis，PATS）是一个以最小化可唯一自组装给定矩形图案的直线瓦片组装系统为目标的组合优化问题，是NP难问题.当PATS由常数c参数化时，它变得实际上有意义，使得任何给定的图案都保证最多包含c种颜色（c-PATS）。我们首先研究简单的模式和性质的最小RTAS他们。在此基础上，设计了一个59色的图案，将3SAT约简为59色的图案，并证明了59-PATS是NP-难的。
cs.CCcs.DS
不确定费用组合优化问题及OWA准则
Combinatorial optimization problems with uncertain costs and the OWA criterion
讨论了一类费用不确定的组合优化问题。通过指定包含$K$不同成本场景的离散场景集来建模不确定性。采用有序加权平均（OWA）聚集算子进行选择。最大值、最小值、平均值、Hurwicz和中位数等标准都是OWA的特例。利用最优加权法，可以推广求解费用不确定的组合优化问题的传统极小-极大方法。研究了这类问题的最小化OWA问题的计算复杂性和可逼近性，并给出了一些新的正反结果.这些结果对许多重要问题仍然有效，例如网络或资源分配问题。
cs.CCcs.DS
多目标组合Optimization的输出敏感复杂性
Output-sensitive Complexity of Multiobjective Combinatorial Optimization
研究了多目标组合最优化问题的输出敏感算法及其复杂性。在这个计算复杂性框架中，一般计数问题的算法如果是输出敏感的，即，其运行时间由输入和输出大小的多项式限定。我们提供了实际的例子MOCO问题，这种有效的算法存在，以及问题，没有有效的算法存在温和的复杂性理论假设下。
cs.CCcs.DSmath.OC
On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims
There has been a series of developments in the recent literature (by essentially a same "circle" of authors) with the absolute/unconditioned (implicit or explicit) claim that there exists no abstraction of an NP-Complete combinatorial optimization problem in which the defining combinatorial configurations (such as "tours" in the case of the traveling salesman problem (TSP) for example) can be modeled by a polynomial-sized system of linear constraints. The purpose of this paper is to provide general as well as specific refutations for these recent claims.
cs.CCcs.DSmath.OC
Power of human-algorithm collaboration in solving combinatorial optimization problems
University of Eastern Finland（东芬兰大学）
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such problem is maximum clique which -- under standard assumptions in complexity theory -- cannot be solved in sub-exponential time or be approximated within polynomial factor efficiently. We show that if a polynomial time algorithm can query informative Gaussian priors from an expert $poly(n)$ times, then a class of combinatorial optimization problems can be solved efficiently in expectation up to a multiplicative factor $ε$ where $ε$ is arbitrary constant. While our p…
cs.CCcs.DScs.LG
参数化移位组合优化
Parameterized Shifted Combinatorial Optimization
移位组合优化是一种新的非线性优化框架，它是标准组合优化的广泛扩展，涉及一次选择多个可行解。这个框架捕获了从所谓的脆弱性问题到共享和分区问题的各种各样的问题。特别地，每个标准的组合优化问题都有其移位的对应问题，这通常要困难得多。已经显式给定输入集的转移问题可能是NP难的。在这篇文章中，我们开始研究这个框架的参数化的复杂性。首先，我们表明，在一个明确给定的集与其基数作为参数可能是XP，FPT或P，这取决于目标函数的移动。其次，我们研究了MSO逻辑中可定义集合上的移位问题（包括，例如，众所周知的MSO分割问题）。我们的主要结果是：MSO可定义集上的移位组合优化在XP中关于MSO公式和输入图的树宽（或更一般的树宽），并且即使在更严格的限制下也是W[1]-困难的.
cs.CCcs.DMcs.DS
关于Fiorini等人的“组合优化中多面体的指数下界“（2015）：对描述变量不相交的模型的反驳
On "Exponential Lower Bounds for Polytopes in Combinatorial Optimization" by Fiorini et al. (2015): A Refutation For Models With Disjoint Sets of Descriptive Variables
我们对Fiorini et al.（2015）* 关于描述变量不相交的模型的发展进行了数值反驳。我们还提供了一个深入了解这种模型的解决方案之间的一对一的线性映射的存在的意义。* ：Fiorini，S.，S. Massar，S. H.R.波库塔蒂瓦里和R. de Wolf（2015）.组合优化中多胞形的指数下界。ACM杂志62：2，第17条。
cs.CCcs.DMcs.DS
Generating Hard Instances for Robust Combinatorial Optimization
While research in robust optimization has attracted considerable interest over the last decades, its algorithmic development has been hindered by several factors. One of them is a missing set of benchmark instances that make algorithm performance better comparable, and makes reproducing instances unnecessary. Such a benchmark set should contain hard instances in particular, but so far, the standard approach to produce instances has been to sample values randomly from a uniform distribution. In this paper we introduce a new method to produce hard instances for min-max combinatorial optimization…
cs.CCcs.DMcs.PF
Complex matter field universal models with optimal scaling for solving combinatorial optimization problems
We develop a universal model based on the classical complex matter fields that allow the optimal mapping of many real-life NP-hard combinatorial optimisation problems into the problem of minimising a spin Hamiltonian. We explicitly formulate one-to-one mapping for three famous problems: graph colouring, the travelling salesman, and the modular N-queens problem. We show that such a formulation allows for several orders of magnitude improvement in the search for the global minimum compared to the standard Ising formulation. At the same time, the amplitude dynamics escape from the local minima.
cond-mat.dis-nncond-mat.stat-mechcs.CC
