Title of article
A disturbed version of the greedy algorithm Original Research Article
Author/Authors
W. Wenzel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
3
From page
35
To page
37
Abstract
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.
Keywords
Greedy Algorithm , Stability , Matroids , Discrete optimization
Journal title
Applied Mathematics Letters
Serial Year
1999
Journal title
Applied Mathematics Letters
Record number
896805
Link To Document