跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22023 · v1

Single-Vertex Metropolis on Minor-Free Graphs: A General EPTAS

首次提交 2026-11-17 08:23
版本更新 2026-11-17 08:23
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

We consider a class of combinatorial optimization problems where the goal is to find a largest induced subgraph with a prescribed property. We assume that the property is preserved by taking induced subgraphs and disjoint unions, holds for all edgeless graphs, and can be tested in polynomial time. We study the single-vertex Metropolis process for this class of problems. We show that on graphs excluding an arbitrary fixed minor HH, this process is a randomized efficient polynomial-time approximation scheme. Starting from any feasible solution on a graph with nn vertices, it finds a (1−ε)(1-\varepsilon)-approximation within exp⁡(OH(ε−2))n(n+log⁡(1/δ))\exp(O_H(\varepsilon^{-2})) n(n+\log(1/δ)) steps with probability at least 1−δ1-δ. This includes maximum independent set, maximum induced forest, maximum induced bipartite subgraph, and maximum induced subgraph of degree at most one. The proof uses improving exchanges on one fixed division of the input graph into regions. A recursive separator construction performs each exchange inside a region of size rr in at most 2r2r moves, with temporary loss OH(r)O_H(\sqrt r). We count move sequences through each transition and bound the probability of avoiding all near-optimal states. The general theorem bounds the number of Metropolis steps in terms of the temporary loss along improvement paths. We extend the result to bounded weight imbalance and give a weighted-star obstruction for unrestricted weights.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 08:23 · 最新观测版本

Single-Vertex Metropolis on Minor-Free Graphs: A General EPTAS

We consider a class of combinatorial optimization problems where the goal is to find a largest induced subgraph with a prescribed property. We assume that the property is preserved by taking induced subgraphs and disjoint unions, holds for all edgeless graphs, and can be tested in polynomial time. We study the single-vertex Metropolis process for this class of problems. We show that on graphs excluding an arbitrary fixed minor HH, this process is a randomized efficient polynomial-time approximation scheme. Starting from any feasible solution on a graph with nn vertices, it finds a (1−ε)(1-\varepsilon)-approximation within exp⁡(OH(ε−2))n(n+log⁡(1/δ))\exp(O_H(\varepsilon^{-2})) n(n+\log(1/δ)) steps with probability at least 1−δ1-δ. This includes maximum independent set, maximum induced forest, maximum induced bipartite subgraph, and maximum induced subgraph of degree at most one. The proof uses improving exchanges on one fixed division of the input graph into regions. A recursive separator construction performs each exchange inside a region of size rr in at most 2r2r moves, with temporary loss OH(r)O_H(\sqrt r). We count move sequences through each transition and bound the probability of avoiding all near-optimal states. The general theorem bounds the number of Metropolis steps in terms of the temporary loss along improvement paths. We extend the result to bounded weight imbalance and give a weighted-star obstruction for unrestricted weights.

查看此版本解读 →查看此版本原文 ↗