交通网络参数的层次结构与硬度结果
Hierarchy of Transportation Network Parameters and Hardness Results
摘要:
引入图参数公路维数和骨架维数来刻画交通网络的性质。由于许多重要的优化问题,如旅行商,斯坦纳树或$k$ -中心出现在这样的网络,这是值得研究的有界公路或骨架维数的图。我们调查所提到的参数之间的关系,以及它们是如何与其他重要的图形参数,已成功地应用到各种优化问题。我们表明,骨架尺寸是无法比拟的任何参数的距离线性森林,带宽,树宽和公路尺寸,因此,这是值得研究的上述问题也有界的骨架尺寸的图。此外,我们证明了骨架维数的上限由最大叶数和任何图的至少三个顶点有边的重量,使这两个参数是相等的。然后,我们表明,计算公路尺寸根据最新的定义是NP-困难的,这回答了一个公开的问题,Feldmann等人所述。最后,我们证明了在图$G=(V,E)$的骨架尺寸$\mathcal{O}(\log^2 \vert V \vert)$它是NP-困难的近似$k$ -中心问题的一个因素小于$2$。
英文摘要:
The graph parameters highway dimension and skeleton dimension were introduced to capture the properties of transportation networks. As many important optimization problems like Travelling Salesperson, Steiner Tree or $k$-Center arise in such networks, it is worthwhile to study them on graphs of bounded highway or skeleton dimension. We investigate the relationships between mentioned parameters and how they are related to other important graph parameters that have been applied successfully to various optimization problems. We show that the skeleton dimension is incomparable to any of the parameters distance to linear forest, bandwidth, treewidth and highway dimension and hence, it is worthwhile to study mentioned problems also on graphs of bounded skeleton dimension. Moreover, we prove that the skeleton dimension is upper bounded by the max leaf number and that for any graph on at least three vertices there are edge weights such that both parameters are equal. Then we show that computing the highway dimension according to most recent definition is NP-hard, which answers an open question stated by Feldmann et al. Finally we prove that on graphs $G=(V,E)$ of skeleton dimension $\mathcal{O}(\log^2 \vert V \vert)$ it is NP-hard to approximate the $k$-Center problem within a factor less than $2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。