Held–Karp 界的半流式估计与图度量 TSP 代价
Semi-Streaming Estimation of the Held--Karp Bound and Graph-Metric TSP Cost
AI总结:
该研究针对图度量 TSP 的 Held–Karp 界,提出多趟仅插入流式算法实现 (1+ε) 倍上近似,可推导出 TSP 代价估计,且证明单趟近似需二次空间。
摘要:
Held–Karp 界是度量旅行商问题(TSP)的线性规划下界。针对由带权连通图诱导的度量,我们在多趟仅插入流式模型中近似该界。对于含 n 个顶点、m 条边的图及 0<ε≤1/2,该算法以高概率返回 (1+ε) 倍的上近似,每趟使用 Õ(ε⁻⁴) 次遍历、Õ(nε⁻²) 个存储字及 Õ(mε⁻⁴) 次算术运算。我们用乘权更新(MWU)的短历史序列替代变化的边权向量,初始化后重复更新直至某列被移除,将每次重复更新存储一次并记录重复次数,记录长度取决于列数而非更新次数,该结论适用于任意固定非负矩阵。针对 Held–Karp 问题,树路径查询可从这些记录中恢复边权;独立的搜索与更新阈值允许在连续搜索阶段生成新的稀疏化器;可控舍入实现了有限精度的运算。该估计可得到 (3/2+ε) 倍的图度量 TSP 值估计,若输入图为无权图则可达 (7/5+ε) 倍估计。反之,在带权图流中,对于固定 0≤η<1,任何单趟 (1+η) 倍的 Held–Karp 上近似都需要二次空间。这些算法仅估计数值,不构造落在这些界内的巡游路线。
英文摘要:
The Held--Karp bound is a linear-programming lower bound for the metric traveling salesperson problem (TSP). We approximate this bound in the multi-pass insertion-only streaming model for metrics induced by connected positive-weight graphs. For an $n$-vertex, $m$-edge graph and $0<\eps\le1/2$, the algorithm returns a $(1+\eps)$ upper approximation with high probability, using $\wtO(\eps^{-4})$ passes, $\wtO(n\eps^{-2})$ words, and $\wtO(m\eps^{-4})$ arithmetic operations per pass. We replace the changing edge-weight vector by a short history of multiplicative-weights (MWU) updates. After initialization, updates repeat until a column is removed. We store each repeated update once, with its repetition count. The record length depends on the number of columns, not updates; the argument applies to any fixed nonnegative matrix. For Held--Karp, tree-path queries recover edge weights from these records. Separate search and update thresholds allow fresh sparsifiers at successive search stages. Controlled rounding gives a bounded-precision implementation. The estimate yields a $(3/2+\eps)$ graph-metric TSP value estimate and a $(7/5+\eps)$ estimate when the input graph is unweighted. Conversely, in weighted graph streams, every one-pass $(1+η)$ upper approximation to Held--Karp, for fixed $0\leη<1$, requires quadratic space. The algorithms estimate values; they do not construct tours within these bounds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。