Approximation-preserving reduction (APR) is a concept in computational complexity theory and optimization that relates to how problems can be transformed into one another while preserving the quality of approximate solutions. It is particularly useful in the study of NP-hard problems and their approximability.

Ancestors (6)

  1. Approximation algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version