Characterizations of polygreedoids and poly-antimatroids by greedy algorithms

Authors:
Masataka Nakamura
Affiliations:
Department of Systems Sciences, College of Arts and Sciences, University of Tokyo, Komaba 3-8-1, Tokyo, 153-8902 Japan
Venue:
Operations Research Letters
Year:
2005

Citing 3
Cited 1

An algorithmic characterization of antimatroids

Discrete Applied Mathematics
Examples and algorithmic properties of Greedoids

COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
Chip-firing games on graphs

European Journal of Combinatorics

Recognition of Antimatroidal Point Sets

Graph Theory, Computational Intelligence and Thought

Quantified Score

Hi-index	0.00

Visualization

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.