MAD 6510 Algorithms in Discrete Structures

Credit Hours: 3

The course will survey a variety of topics related to algorithms on discrete combinatorial structures such as combinatorial optimization, linear and integer programming, computational complexity, approximation algorithms, and randomized algorithms.

Prerequisite(s): None
Corequisite(s): None
Co-Prerequisite(s): None

USF College of Arts and Sciences | Department of Mathematics and Statistics