Lecture Notes on Approximation Algorithms
- 1992
- 136 pages
Opens the author, publisher or archive page. This title is hosted externally.
Attempt to classify all hard optimization problems as one of the possibilities for relaxing the requirements, from the point of view of approximability: easy, intermediate and hard.
Bibliographic record recovered from the original FreeTechBooks listing. View archived source.
