Abstract
There are hosts of algorithm design techniques that have been studied:
-
divide and conquer
-
dynamic programming
-
randomization
-
greedy algorithms and matroids
-
transformation to a graph algorithm (network flow, etc.)
-
optimization algorithms (hill climbing, simulated annealing, etc.)
-
approximation algorithms
-
linear programming
-
heuristic search
-
genetic algorithms
-
"software tools"
-
etc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 J.A. Storer
About this chapter
Cite this chapter
Storer, J.A. (2002). Algorithm Design. In: An Introduction to Data Structures and Algorithms. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0075-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0075-8_5
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6601-3
Online ISBN: 978-1-4612-0075-8
eBook Packages: Springer Book Archive