Bidirected minimum Manhattan network problem

Details Bidirected minimum Manhattan network problem Bidirected minimum Manhattan network problem

2011-07-07

arxiv.org/abs/1107.1359v1

Computer Science

Computational Geometry

14 pages, 16 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bidirected minimum Manhattan network problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bidirected minimum Manhattan network problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bidirected minimum Manhattan network problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-416793