Drexel University Home Pagewww.drexel.edu DREXEL UNIVERSITY LIBRARIES HOMEPAGE >>

iDEA: Drexel E-repository and Archives > Drexel Theses and Dissertations > Drexel Theses and Dissertations > Optimal matching and deterministic sampling

Please use this identifier to cite or link to this item: http://hdl.handle.net/1860/2526

Title: Optimal matching and deterministic sampling
Authors: Abrahamson, Jeff
Keywords: Computer science;Computer algorithms;Mathematics
Issue Date: 27-Dec-2007
Abstract: Randomness is a fundamental problem in theoretical computer science. This research considers two questions concerning randomness. First, it examines some extremal point matching problems, exploring the dependence of matching weight with partition cardinality in vertex-weighted bipartite graphs. Second, it considers the problem of subset selection, providing several deterministic algorithms for point selection that are as good as or better than random subset selection according to various criteria.
URI: http://hdl.handle.net/1860/2526
Appears in Collections:Drexel Theses and Dissertations

Files in This Item:

File Description SizeFormat
Abrahamson_Jeff.pdf671.34 kBAdobe PDFView/Open
View Statistics

Items in iDEA are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! iDEA Software Copyright © 2002-2010  Duraspace - Feedback