Optimization problems and approximation algorithms

Authors

  • Petr Osička Faculty of Science, Palacký University, Olomouc

Abstract

Solving an optimization problem amounts to finding an object with the best cost. For some problems, there are efficient algorithms for finding such an object. For others, we have to settle for an approximate solution. Using examples of well-known problems we discuss both these possibilities.

Published

2021-11-30

How to Cite

Osička, P. (2021). Optimization problems and approximation algorithms. MATHEMATICS–PHYSICS–INFORMATICS, 30(4), 299–305. Retrieved from https://mfi.upol.cz/index.php/mfi/article/view/564

Issue

Section

Informatics