Finite Covering Problems
In this chapter we conduct a survey of the occurrence of finite covering problems in graph theory, operations research, and miscellaneous fields, seeking to unite such instances within a common framework. We then offer a unified approach to the solution of such problems. Elements of a general theory are presented, and two exhaustive solution methodologies are given, those we call the branching method and the algebraic method. The latter leads rather naturally to an introduction to distributive lattices and their application to discrete decision problems. This report should serve equally well as an introductory survey for readers wishing to become acquainted with the origins and the mathematical treatment of covering problems and as a classroom module for supplementing courses in mathematical modeling, applications of graph theory, discrete mathematical structures, and the like.
KeywordsChromatic Number Covering Problem Incidence Matrix Algebraic Method Pictorial Representation
Unable to display preview. Download preview PDF.
- G. Birkhoff, Lattice Theory, 3rd. ed. Providence, RI: AMS Colloquium Publications, American Mathematical Society, 1973.Google Scholar
- S. Even Algorithmic Combinatories. New York: MacMillan, 1973. Google Scholar
- R. Prather, Discrete Mathematical Structures for Computer Science. Boston: Houghton Mifflin, 1976.Google Scholar