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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.