最优随机平坦化
Optimal stochastic planarization
摘要:
Indyk和Sidiropoulos [IS 07]证明了亏格g>0的任何图都可以随机嵌入到畸变为2^O(g)的平面图上的分布中。这个界限后来被Borradaile、Lee和Sidiropoulos改进为O(g^2)[BLS 09]。我们给出了一个嵌入失真O(log g),这是渐近最优的。除了改进的失真,我们的嵌入的另一个优点是,它可以在多项式时间计算。相比之下,[BLS 09]的算法需要解决NP难问题。我们的研究结果意味着,特别是减少了一个大类的几何优化问题的实例genus-g图,相应的平面图,与O(log g)的损失因子的近似保证。
英文摘要:
It has been shown by Indyk and Sidiropoulos [IS07] that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs with distortion 2^O(g). This bound was later improved to O(g^2) by Borradaile, Lee and Sidiropoulos [BLS09]. We give an embedding with distortion O(log g), which is asymptotically optimal. Apart from the improved distortion, another advantage of our embedding is that it can be computed in polynomial time. In contrast, the algorithm of [BLS09] requires solving an NP-hard problem. Our result implies in particular a reduction for a large class of geometric optimization problems from instances on genus-g graphs, to corresponding ones on planar graphs, with a O(log g) loss factor in the approximation guarantee.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。