Computer Science Technical Reports
CS at VT

Derandomized Vector Sorting

Heath, Lenwood S and Mateescu, Gabriel (1998) Derandomized Vector Sorting. Technical Report ncstrl.vatech_cs//TR-98-19, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
Postscript - Requires a viewer, such as GhostView (164553)


An instance of the vector sorting problem is a sequence of k-dimensional vectors of length n. A solution to the problem is a permutation of the vectors such that in each dimension the length of the longest decreasing subsequence is O(sqrt(n)). A random permutation solves the problem. Here we derandomize the obvious probabilistic algorithm and obtain a deterministic O(kn^3.5) time algorithm that solves the vector sorting problem. We also apply the algorithm to a book embedding problem.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:498
Deposited By:User autouser
Deposited On:05 December 2001
Alternative Locations: URL:, URL: