About this document
Vertex Cover Approximation Algorithm by Ruchi Jaiswal is a document available to read on EtoBox.
The document discusses approximation algorithms for solving NP-hard optimization problems. It defines approximation algorithms as algorithms that find near-optimal solutions in polynomial time, as opposed to exact algorithms that may have exponential runtime. The goal of approximation algorithms is to come as close as possible to the optimal value within polynomial time. Performance is measured by the ratio between the approximate and optimal solutions. Examples given include vertex cover and traveling sale
- Author
- Ruchi Jaiswal
- Language
- EN