Skip to main content

Consortium for Mathematics and its Applications

Product ID: 99781
Supplementary Print
Undergraduate

Matroids: The Theory and Practice of Greed (UMAP)

Author: Christian Jones


This module introduces matroids and demonstrats their application to several discrete optimization problems.

Table of Contents:

INTRODUCTION

MATROIDS

FROM MATROIDS TO GREEDY ALGORITHMS

A SCHEDULING PROBLEM

A TASK ASSIGNMENT PROBLEM

CONCLUSION

EXERCISES

SOLUTIONS TO THE EXERCISES

REFERENCES

ABOUT THE AUTHORS

©2000 by COMAP, Inc.
UMAP Module
23 pages

Mathematics Topics:

Discrete & Finite Mathematics , Abstract & Linear Algebra , Computer Science , Algorithms

Application Areas:

Computers & Technology , Discrete Optimization

Prerequisites:

The reader is assumed to be familiar with elementary concepts in linear algebra (definition and properties of linear independence) and in graph theory (definition of a graph, bipartite graph, and path).

You must have a Full Membership to download this resource.

If you're already a member, login here.

Not yet a member?