An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
计算几何
2007-05-23 v2 离散数学
摘要
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).
引用
@article{arxiv.cs/0507013,
title = {An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment},
author = {Justin Colannino and Mirela Damian and Ferran Hurtado and John Iacono and Henk Meijer and Suneeta Ramaswami and Godfried Toussaint},
journal= {arXiv preprint arXiv:cs/0507013},
year = {2007}
}
备注
13 pages, 8 figures