Optimal matching and deterministic sampling

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.