TY  - BOOK
AU  - Vazirani,Vijay V.
TI  - Approximation algorithms
SN  - 3540653678 (alk. paper)
AV  - QA76.9.A43 V39 2003
U1  - 511.8 21
PY  - 2003///
CY  - Berlin, New York
PB  - Springer
KW  - Computer algorithms
KW  - Mathematical optimization
N1  - Includes bibliographical references (p. [357]-372) and index; 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
ER  -