Canonical greedy algorithms and dynamic programming

MaRDI QIDQ3437245zbMATH OpenFDO

Authors Art Lew

Publication date 14 May 2007

Full work available at URL https://eudml.org/doc/209438

zbMATH Keywords

dynamic programminggreedy algorithmDijkstra

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming in optimal control and differential games (49L20)

Recommendations

• Greedy can beat pure dynamic programming
• A class of greedy algorithms and its relation to greedoids
• On the Greedy Solution of Ordering Problems
• (Incremental) priority algorithms
• Recognizing Greedy Structures

Cited in

(8)

• Toward an Automatic Approach to Greedy Algorithms
• Interpolating greedy and reluctant algorithms
• Greedy algorithms and Zipf laws
• Carousel greedy: a generalized greedy algorithm with applications in optimization
• The classification of greedy algorithms
• A class of greedy algorithms and its relation to greedoids
• Greedy can beat pure dynamic programming
• When greedy gives optimal: a unified approach

This page was built for publication: Canonical greedy algorithms and dynamic programming

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