Approximation Algorithms
38 likes10,399 views
The document discusses approximation algorithms for NP-complete problems. It introduces the idea of finding near-optimal solutions in polynomial time for problems where optimal solutions cannot be found efficiently. It provides examples of the vertex cover problem and set cover problem, describing greedy approximation algorithms that provide performance guarantees for finding near-optimal solutions for these problems. The document also discusses some open questions around whether these approximation ratios can be improved.
1 of 53
More Related Content
What's hot (20)
Similar to Approximation Algorithms (20)
Ad
More from Nicolas Bettenburg (20)
PDF
10 Year Impact Award Presentation - Duplicate Bug Reports Considered Harmful ...Nicolas BettenburgPDF
Ph.D. Dissertation - Studying the Impact of Developer Communication on the Qu...Nicolas BettenburgPDF
Mining Development Repositories to Study the Impact of Collaboration on Softw...Nicolas BettenburgPDF
Managing Community Contributions: Lessons Learned from a Case Study on Andro...Nicolas BettenburgPDF
An Empirical Study on the Risks of Using Off-the-Shelf Techniques for Process...Nicolas BettenburgAd