双向最小曼哈顿网络问题
Bidirected minimum Manhattan network problem
摘要：
在双向最小Manhattan网络问题中，给定一个平面上的n个终端的集合T，我们需要构造一个网络N（T），它的总长度最小，且N（T）的边是轴平行的，并且N（T）中的每一个有序终端对都通过一条有向Manhattan路连接。提出了求解双向最小Manhattan网络问题的多项式因子2近似算法。
英文摘要：
In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N(T) of minimum total length with the property that the edges of N(T) are axis-parallel and oriented in a such a way that every ordered pair of terminals is connected in N(T) by a directed Manhattan path. In this paper, we present a polynomial factor 2 approximation algorithm for the bidirected minimum Manhattan network problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
