Master of Science in Computer Science
First Committee Member
Wolfgang Bein, Chair
Second Committee Member
Ajoy K Datta
Third Committee Member
Graduate Faculty Representative
Number of Pages
Monge properties play an important role in theoretical computer science. Many greedy algorithms are based on such properties, as is speedup in dynamic programming. Monge properties are simple monotonicity properties which are observed and used in various settings such as resource optimization, computational geometry, statistical sampling, computational biology and coding.
Computer science; Dynamic programming; Matrices
Computer Sciences | Programming Languages and Compilers | Theory and Algorithms
Sethumadhavan, Swetha, "A Survey of Monge Properties" (2009). UNLV Theses, Dissertations, Professional Papers, and Capstones. 1198.