arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.12291cs.CCcs.DS
收藏

关于鲁棒网络设计的逼近性

On the Approximability of Robust Network Design

Yacine Al-Najjar, Walid Ben-Ameur, Jeremie Leguay

摘要:

鉴于交通的动态性质,我们调查的变体,强大的网络设计,我们必须确定的能力,保留在每个链接,使每个需求向量属于一个多面体集可以路由。目标是最小化拥塞或线性成本。假定路由是分段的和动态的(即,取决于当前业务矢量)。我们首先证明了最小拥塞的鲁棒网络设计问题不能近似于任何常数因子。然后,利用ETH猜想,我们得到了这个问题的可逼近性的一个$Ω(\frac{\log n}{\log \log n})$下界。这意味着Räcke在2008年建立的著名的$O(\log n)$近似比是紧的。利用拉格朗日松弛,我们得到了$O(\log n)$逼近的新证明。基于拉格朗日的减少和我们的不可近似性结果的一个重要后果是,具有线性保留成本的鲁棒网络设计问题不能近似在任何恒定的比率。这回答了Chekuri(2007)长期以来的一个悬而未决的问题。我们还给出了Goyal\&al(2009)的结果的另一个证明,即静态路由下的最优线性成本可能比动态路由下获得的成本贵$Ω(\log n)$。最后,我们表明,即使只有两个给定的路径允许每个商品,最小拥塞或线性成本的鲁棒网络设计问题是很难近似在一些常数。

英文摘要:

Given the dynamic nature of traffic, we investigate the variant of robust network design where we have to determine the capacity to reserve on each link so that each demand vector belonging to a polyhedral set can be routed. The objective is either to minimize congestion or a linear cost. Routing is assumed to be fractional and dynamic (i.e., dependent on the current traffic vector). We first prove that the robust network design problem with minimum congestion cannot be approximated within any constant factor. Then, using the ETH conjecture, we get a $Ω(\frac{\log n}{\log \log n})$ lower bound for the approximability of this problem. This implies that the well-known $O(\log n)$ approximation ratio established by Räcke in 2008 is tight. Using Lagrange relaxation, we obtain a new proof of the $O(\log n)$ approximation. An important consequence of the Lagrange-based reduction and our inapproximability results is that the robust network design problem with linear reservation cost cannot be approximated within any constant ratio. This answers a long-standing open question of Chekuri (2007). We also give another proof of the result of Goyal\&al (2009) stating that the optimal linear cost under static routing can be $Ω(\log n)$ more expensive than the cost obtained under dynamic routing. Finally, we show that even if only two given paths are allowed for each commodity, the robust network design problem with minimum congestion or linear cost is hard to approximate within some constant.

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

↑