Constrained Searching and Ordering Problems onequences
Date Issued
2008
Date
2008
Author(s)
Liu, Hsiao-Fei
Abstract
In this dissertation, we study a series of problems on sequences. These problems are broadlyategorized into four types: Optimization, enumeration, selection, and ordering. Problems ofhe first three types are generally called the searching problems. In the optimization problem,e seek for the best feasible solution. In the enumeration problem, we have to enumerate the kest feasible solutions. In the selection problem, we pick out the kth best feasible solution. Inhe ordering problem, we are required to reorder a sequence subject to some constraints. Allroblems considered in this dissertation are already known to be polynomial-time solvable, soe aim at giving efficient exact algorithms for them.
Subjects
sequence
optimization
enumeration
selection
ordering
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-F92922019-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):28deec0e281dfbf8a9985033b302f894