带查询提示的首次通过渗流
First Passage Percolation with Queried Hints
AI总结:
本文研究动态边代价图中的最短路径查询复杂度,在首次通过渗流模型下证明常数连续加倍维度图只需探测近常数数量边即可获得 (1+ε)-近似,并推广到相关设置。
摘要:
求解优化问题能在各种现实应用中带来优雅且实用的解决方案。在许多此类现实应用中,刻画相关优化问题所需的部分信息存在噪声、不确定性,并且获取成本高昂。在本文中,我们研究为了获得相关问题的近似最优解,需要查询多少此类信息。特别地,我们关注具有动态边代价的图中的最短路径问题。我们采用概率论中的 first passage percolation(首次通过渗流)模型:在该模型中,图 G' 由一个加权基础图 G 导出,方法是将每条边的权重乘以一个独立选取的、位于 [1, ρ] 中的随机数。当 G 是 d 维网格图时,数学家已对该模型进行了广泛研究,但在一般图中,该模型下最短路径的行为仍知之甚少。我们针对一类类似于现实道路网络的图在这一方向上取得了进展。具体而言,我们证明,如果 G 具有常数连续加倍维度,那么对于给定的 s-t 点对,只需探测 G' 中 ((ρ log n)/ε)^{O(1)} 条边的权重,即可获得 G' 中 s-t 距离的 (1+ε)-近似。我们还将该结果推广到相关设置,并通过实验证明探测能够提高估计 s-t 距离的准确性。
英文摘要:
Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is noisy, uncertain, and expensive to obtain. In this work, we study how much of that information needs to be queried in order to obtain an approximately optimal solution to the relevant problem. In particular, we focus on the shortest path problem in graphs with dynamic edge costs. We adopt the $\textit{first passage percolation}$ model from probability theory wherein a graph $G'$ is derived from a weighted base graph $G$ by multiplying each edge weight by an independently chosen random number in $[1, ρ]$. Mathematicians have studied this model extensively when $G$ is a $d$-dimensional grid graph, but the behavior of shortest paths in this model is still poorly understood in general graphs. We make progress in this direction for a class of graphs that resemble real-world road networks. Specifically, we prove that if $G$ has a constant continuous doubling dimension, then for a given $s-t$ pair, we only need to probe the weights on $((ρ\log n )/ ε)^{O(1)}$ edges in $G'$ in order to obtain a $(1 + ε)$-approximation to the $s-t$ distance in $G'$. We also generalize the result to a correlated setting and demonstrate experimentally that probing improves accuracy in estimating $s-t$ distances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。