论文信息 - The Computational Complexity of Antimatroid Properties

The Computational Complexity of Antimatroid Properties

Oracle complexity for antimatroids is defined. Several antimatroid oracles are compared and their relative strengths are examined. Characterizations of several classes of antimatroids are given, and the complexity of recognising membership of these classes is examined.

Jamas Enright | J. Enright | Jamas Enright

[1] Günter M. Ziegler,et al. Matroid Applications: Introduction to Greedoids , 1992 .

[2] M. Grötschel,et al. Combinatorial optimization , 1996 .

[3] D. Welsh,et al. The computational complexity of matroid properties , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.

[4] Rainer Schrader,et al. A Survey on Oracle Techniques , 1981, MFCS.

[5] László Lovász,et al. Examples and algorithmic properties of Greedoids , 1989 .

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Paul D. Seymour,et al. Recognizing graphic matroids , 1981 .