Abstract
AbstractGreedy algorithms are among the most elementary ones in theoretical computer science and understanding the conditions under which they yield an optimum solution is a widely studied problem. Greedoids were introduced by Korte and Lovász at the beginning of the 1980s as a generalization of matroids. One of the basic motivations of the notion was to extend the theoretical background behind greedy algorithms beyond the well-known results on matroids. Indeed, many well-known algorithms of a greedy nature that cannot be interpreted in a matroid-theoretical context are special cases of the greedy algorithm on greedoids. Although this algorithm turns out to be optimal in surprisingly many cases, no general theorem is known that explains this phenomenon in all these cases. Furthermore, certain claims regarding this question that were made in the original works of Korte and Lovász turned out to be false only most recently. The aim of this paper is to revisit and straighten out this question: we summarize recent progress and we also prove new results in this field. In particular, we generalize a result of Korte and Lovász and thus we obtain a sufficient condition for the optimality of the greedy algorithm that covers a much wider range of known applications than the original one.
Funder
Emberi Eroforrások Minisztériuma
Hungarian Scientific Research Fund
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference9 articles.
1. Boyd EA (1988) A combinatorial abstraction of the Shortest Path Problem and Its Relationship to Greedoids, CAAM Technical Report, 30 pages
2. Edmonds J (1971) Matroids and the greedy algorithm. Math Program 1(1):127–136
3. Korte B, Lovász L (1981) Mathematical Structures Underlying Greedy Algorithms. In: Gécseg F (ed) Fundamentals of Computation Theory, , FCT81. Lecture Notes in Computer Science (117), Springer, Berlin, Heidelberg, pp 205–209
4. Korte B, Lovász L (1984) Greedoids - a structural framework for the greedy algorithm. In: Pulleyblank W (ed) Progress in combinatorial optimization. Academic Press, London, pp 221–243
5. Korte B, Lovász L (1984) Greedoids and linear objective functions. SIAM J Algebraic Dis Methods 5(2):229–238
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献