The Approximability of Learning and Constraint Satisfaction Problems
An α-approximation algorithm is an algorithm guaranteed to output a solutionthat is within an α ratio of the optimal solution. We are interested in thefollowing question: Given an NP-hard optimization problem, what is the bestapproximation guarantee that any polynomial time algorithm could achieve?...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Research Showcase @ CMU
2010
|
| Subjects: | |
| Online Access: | http://repository.cmu.edu/dissertations/24 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1025&context=dissertations |