A framework for the greedy algorithm

Discrete Applied Mathematics

Volumn 121, Issue 1-3, 2002, Pages 247-260

  Vince, A ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Coxeter matroid; Greedy Algorithm; matroid

Indexed keywords

EID: 84867969958     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00362-6     Document Type: Article

References (11)

1. A. Bouchet Greedy algorithm and symmetric matroids Math. Programming 38 1987 147 159
2. A. Borovik, I. Gelfand, and N. White Symplectic matroids J. Alg. Combin. 8 1998 235 252 (Pubitemid 128508057)
3. J. Edmonds Matroids and the greedy algorithm Math. Programming 1 1971 127 136
4. D. Gale Optimal assignments in an ordered set: an application of matroid theory J. Combin. Theory 4 1968 1073 1082
5. I.M. Gelfand, and V.V. Serganova On a general definition of a matroid and a greedoid Soviet Math. Dokl. 35 1987 6 10
6. I.M. Gelfand, and V.V. Serganova Combinatorial geometries and torus strata on homogeneous compact manifolds Russian Math. Surveys 42 1987 133 168
7. B. Korte, and L. Lovász Greedoids - a structural framework for the greedy algorithm W. Pulleybank, Progress in Combinatorial Optimization 1984 Academic Press New York 221 243
8. E. Lawler Combinatorial Optimization, Networks and Matroids 1976 Holt, Rinehart and Winston New York
9. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization - Algorithms and Complexity 1982 Prentice-Hall, Inc Holt, Englewood Cliffs, NJ
10. V.V. Serganova, A. Vince, and A. Zelevinsky A geometric characterization of Coxeter matroids Ann. Combin. 1 1997 173 182
11. A. Vince The greedy algorithm and Coxeter matroids J. Alg. Combin. 11 2000 155 178