Skip to main content
Book ChapterOPEN ACCESS

From dynamic programming to greedy algorithms

  • Bird R
  • Moor O
DOI: 10.1007/3-540-57499-9_16
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A calculus of relations is used to reason about specifications and algorithms for optimisation problems. It is shown how certain greedy algorithms can be seen as refinements of dynamic programming. Throughout, the maximum lateness problem is used as a motivating example.

Cite

CITATION STYLE

APA

Bird, R., & Moor, O. (1993). From dynamic programming to greedy algorithms (pp. 43–61). https://doi.org/10.1007/3-540-57499-9_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free