Greedy can also beat pure dynamic programming

Stasys Jukna, Hannes Seiwert. Greedy can also beat pure dynamic programming. Electronic Colloquium on Computational Complexity (ECCC), 25:49, 2018. [doi]

Authors

Stasys Jukna

This author has not been identified. Look up 'Stasys Jukna' in Google

Hannes Seiwert

This author has not been identified. Look up 'Hannes Seiwert' in Google