An Algorithmic Characterization of Antimatroids

Date
1987-12
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

In an article entitled "Optimal sequencing of a single machine subject to precedence constraints," E.L. Lawler presented a now classical minmax result for job scheduling. In essence, Lawler's proof demonstrated that the properties of partially ordered sets were sufficient to solve the posed scheduling problem. These properties are, in fact, common to a more general class of combinatorial structures known as antimatroids, which have recently received considerable attention in the literature. It is demonstrated that the properties of antimatroids are not only sufficient but necessary to solve the scheduling problem posed by Lawler, thus yielding an algorithmic characterization of antimatroids. Examples of problems solvable by the general result are provided.

Description
Advisor
Degree
Type
Technical report
Keywords
Citation

Boyd, E. Andrew. "An Algorithmic Characterization of Antimatroids." (1987) https://hdl.handle.net/1911/101636.

Has part(s)
Forms part of
Published Version
Rights
Link to license
Citable link to this page