An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment

Details An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment

2005-07-05

arxiv.org/abs/cs/0507013v2

Computer Science

Computational Geometry

13 pages, 8 figures

Scientific paper

The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T, such that each point in S maps to exactly one point in T, and each point in T maps to at least one point in S. In this paper we show that this problem has an O(n log n)-time solution, provided that the points in S and T are restricted to lie on a line (linear time, if S and T are presorted).

Affiliated with

Also associated with

No associations

Rating

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment 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 An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-59205