Instead of focusing on the implementation details as other algorithms courses do, it focuses on general techniques and ideas. Peng-Jun Wan , Email: wan cs. Office hours: pm Thusdays, Sturt Building F.
There is no homework and no exam. Deterministic and randomized rounding of linear programs: prize-collecting Steiner tree.
Introduction to semidefinite programming. Randomized rounding of semidefinite programs: coloring 3-colorable graphs.
The primal-dual method: shortest s-t paths, generalized Steiner tree. WS The primal-dual method: generalized Steiner tree, uncapacitated facility location. For the more advanced reader the book seems to be an excellent in-depth resource on approximation algorithms, for their beginning up to the latest developments. It also serves as a reference for established researchers by providing efficient tools for various applied areas like applied mathematics, engineering, medicine, economics, and other sciences.
Buy eBook. Buy Hardcover.
Buy Softcover. Rent the eBook. FAQ Policy.
About this Textbook This book is intended to be used as a textbook for graduate students studying theoretical computer science. Show all.
This ratio was improved to 1. October Don't forget about part Skip to search form Skip to main content. There are, however, very few textbooks available for this course. He was also co-author with P.
Restriction Pages Du, Ding-Zhu et al.