Approximation algorithms
Vazirani, Vijay V.
creator
text
Berlin
New York
Springer
c2001
monographic
xix, 378 p. : illustrations ;
"The challenge met by this book is to capture the beauty and excitement of work in this thriving field and to convey in a lucid manner the underlying theory and methodology. Many of the research results presented have been simplified, and new insights provided. Perhaps the most important aspect of the book is that it shows simple ways of talking about complex, powerful algorithmic ideas by giving intuitive proofs,
Combinatorial algorithms --
Set cover --
Steiner tree and TSP --
Multiway cut and k-cut --
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 --
An overview of complexity theory for the algorithm designer --
Basic facts from probability theory.
Included Problem, Subject Index.
Computer algorithms
Mathematical optimization
005.1 VAZ
3540653678 (alk. paper)
9783540653677
3642084699
9783642084690
http://www.loc.gov/catdir/enhancements/fy0816/2001042005-d.html
http://www.loc.gov/catdir/enhancements/fy0816/2001042005-t.html
http://www.loc.gov/catdir/enhancements/fy0816/2001042005-d.html
http://www.loc.gov/catdir/enhancements/fy0816/2001042005-t.html