Summary and Info
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remarks or theorems.
Review and Comments
Rate the Book
Advances in greedy algorithms 0 out of 5 stars based on 0 ratings.