arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.5517cs.CG
收藏

带多边形球的赋范平面上的最小曼哈顿网络问题:一种因子2.5的近似算法

Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm

Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès

摘要:

设B是R^2的中心对称凸多边形,||p - Q||在单位球为B的赋范平面上,R^2中两点p,q之间的距离。对于R^2中的n个点(终端)的集合T,T上的B-Manhattan网络是网络N(T)=(V,E),其性质是其边平行于B的方向,并且对于每对终端t_i和t_j,网络N(T)包含它们之间的最短B-路径,即,一条长长的路||t_i - t_j||. T上的最小B-Manhattan网络是具有最小可能长度的B-Manhattan网络。Gudmundsson、Levcopoulos和Narasimhan(APPROX'99)在单位球B为正方形(因此距离为||p - Q||是p和q之间的l_1或l_infty-距离),最近Chin,Guo和Sun(SoCG'09)证明了它是强NP-完全的。最小曼哈顿问题的几种近似算法(因子为8、4、3和2)是已知的.本文对最小B-Manhattan网络问题提出了一个因子为2.5的近似算法。该算法采用了一个简化版本的条带阶梯分解,提出了我们的文件(APPROX'05),随后用于其他因素2近似算法的最小曼哈顿问题。

英文摘要:

Let B be a centrally symmetric convex polygon of R^2 and || p - q || be the distance between two points p,q in R^2 in the normed plane whose unit ball is B. For a set T of n points (terminals) in R^2, a B-Manhattan network on T is a network N(T) = (V,E) with the property that its edges are parallel to the directions of B and for every pair of terminals t_i and t_j, the network N(T) contains a shortest B-path between them, i.e., a path of length || t_i - t_j ||. A minimum B-Manhattan network on T is a B-Manhattan network of minimum possible length. The problem of finding minimum B-Manhattan networks has been introduced by Gudmundsson, Levcopoulos, and Narasimhan (APPROX'99) in the case when the unit ball B is a square (and hence the distance || p - q || is the l_1 or the l_infty-distance between p and q) and it has been shown recently by Chin, Guo, and Sun (SoCG'09) to be strongly NP-complete. Several approximation algorithms (with factors 8, 4 ,3 , and 2) for minimum Manhattan problem are known. In this paper, we propose a factor 2.5 approximation algorithm for minimum B-Manhattan network problem. The algorithm employs a simplified version of the strip-staircase decomposition proposed in our paper (APPROX'05) and subsequently used in other factor 2 approximation algorithms for minimum Manhattan problem.

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

↑