Incluye referencias bibliográficas: páginas [355]-370 e índice

Introduction -- Combinatorial Algorithms -- Set cover -- Steiner tree and TSP -- Multiway Cuts and k-Cuts -- k-Center -- Feedback Vertex Set -- Shortest Superstring -- Knapsack -- Bin packing -- Minimum Makespan Scheduling -- Euclidean TSP -- LP-Based Algorithms -- Introduction to LP-Duality -- Set Cover via Dual Fitting -- Rounding Applied to Set Cover -- Set Cover via the Primal-Dual Schema -- Maximum Satisfiability -- Scheduling on Unrelated Parallel Machines -- Multicut and Integer Multicommodity Flow in Trees. Multiway Cut -- Multicut in General Graphs -- Sparsest Cut. Steiner Forest -- Steiner Network -- Facility Location -- k-median -- Semidefinite Programming -- Other Topics -- Shortest Vector -- Counting problems -- Hardness of Approximation -- Open Problems

" This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms." -- P. [4]

http://www.springer.com/la/book/9783540653677?wt_mc=ThirdParty.SpringerLink.3.EPR653.About_eBook#otherversion=9783642084690

Ingeniería en Telemática

NUEVOSTELEMAT