Award Date

5-2009

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Wolfgang Bein, Chair

Second Committee Member

Ajoy K Datta

Third Committee Member

Yoohwan Kim

Graduate Faculty Representative

Venkatesan Muthukumar

Number of Pages

55

Abstract

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.

Keywords

Computer science; Dynamic programming; Matrices

Disciplines

Computer Sciences | Programming Languages and Compilers | Theory and Algorithms

Language

English

Comments

Signatures have been redacted for privacy and security measures.


Share

COinS