The greedy algorithm and Coxeter matroids

DOI10.1023/A:1008780132748MaRDI QIDQ1575099zbMATH OpenFDO

Authors Andrew Vince

Publication date 17 February 2002

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmBruhat orderCoxeter matroidGale order

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• A framework for the greedy algorithm
• scientific article; zbMATH DE number 3904604
• On the generality of the greedy algorithm for solving matroid base problems
• scientific article; zbMATH DE number 169611

Cites work

• scientific article; zbMATH DE number 4019084 (Why is no real title available?)
• scientific article; zbMATH DE number 3759173 (Why is no real title available?)
• scientific article; zbMATH DE number 3781925 (Why is no real title available?)
• A geometric characterization of Coxeter matroids
• An adjacency criterion for Coxeter matroids
• Boundaries of Coxeter matroids
• Bruhat lattices, plane partition generating functions, and minuscule representations
• Combinatorial geometries and torus strata on homogeneous compact manifolds
• Combinatorial geometries, convex polyhedra, and Schubert cells
• Greedoids
• Greedy algorithm and symmetric matroids
• Some characterizations of Coxeter groups
• Symplectic matroids
• The lattice of flats and its underlying flag matroid polytope

Cited in

(6)

• The Greedy Algorithm and the Cohen-Macaulay Property of Rings, Graphs and Toric Projective Curves
• A framework for the greedy algorithm
• Greedy-type resistance of combinatorial problems
• An adjacency criterion for Coxeter matroids
• The Lazy Matroid Problem
• Orthogonal matroids

This page was built for publication: The greedy algorithm and Coxeter matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575099)