𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A greedy-algorithm characterization of valuated Δ-matroids

✍ Scribed by Andreas W.M. Dress; Walter Wenzel

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
297 KB
Volume
4
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A disturbed version of the greedy algori
A disturbed version of the greedy algorithm
✍ W. Wenzel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

We study a disturbed variant of the classical greedy algorithm for weight functions defined on some given finite set E and show that the greedy algorithm for matroids is stable with respect to changes in the input data.

A characterization of threshold matroids
A characterization of threshold matroids
✍ Rick Giles; Ravindran Kannan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 370 KB

~bl if and only if for each pair of , subsets R and S of E, such that IR (JSI ~3, either (i) VTcr E-(RUS), (RUT) E ZF+(SUT)E~

A Unified Treatment of the Geometric Alg
A Unified Treatment of the Geometric Algebra of Matroids and Even Δ-Matroids
✍ Walter Wenzel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 288 KB

The concept of a combinatorial W P U -geometry for a Coxeter group W , a subset P of its generating involutions and a subgroup U of W with P ⊆ U yields the combinatorial foundation for a unified treatment of the representation theories of matroids and of even -matroids. The concept of a W P -matroid