approximation algorithm

Computing Dictionary

approximation algorithm definition

An algorithm for an optimisation problem that generates feasible but not necessarily optimal solutions.
Unlike "heuristic", the term "approximation algorithm" often implies some proven worst or average case bound on performance. The terms are often used interchangeably however.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: approximation
Next Definition: approximation suture
More from
Synonyms and Antonyms for approximation algorithm
More from
Search for articles containing approximation algorithm Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature