| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524219 | Operations Research Letters | 2005 | 6 Pages |
Abstract
A polygreedoid and a poly-antimatroid are the generalization of a greedoid and an antimatroid, respectively, obtained by allowing a word to include repeated elements. We shall describe the algorithmic characterizations of a polygreedoid and of a poly-antimatroid based on bottleneck types of greedy algorithms. A notion of score space is investigated for further study of poly-antimatroids.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Masataka Nakamura,