Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008733355/catalog> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- catalog abstract ""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, by writing algorithms in plain English, and by providing numerous critical examples and illustrations." "This book will be of interest to the scientific community at large and in particular, to students and researchers in Computer Science, Operations Research, and Discrete Mathematics. It can be used both as a text in a graduate course on approximation algorithms and as a supplementary text in basic undergraduate and graduate courses on algorithms."--Jacket.".
- catalog contributor b12236845.
- catalog created "c2001.".
- catalog date "2001".
- catalog date "c2001.".
- catalog dateCopyrighted "c2001.".
- catalog description ""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, by writing algorithms in plain English, and by providing numerous critical examples and illustrations."".
- catalog description ""This book will be of interest to the scientific community at large and in particular, to students and researchers in Computer Science, Operations Research, and Discrete Mathematics. It can be used both as a text in a graduate course on approximation algorithms and as a supplementary text in basic undergraduate and graduate courses on algorithms."--Jacket.".
- catalog description "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.".
- catalog description "Includes bibliographical references (p. [355]-370) and index.".
- catalog extent "xix, 378 p. :".
- catalog identifier "3540653678 (alk. paper)".
- catalog issued "2001".
- catalog issued "c2001.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "005.1 21".
- catalog subject "Computer algorithms.".
- catalog subject "Mathematical optimization.".
- catalog subject "QA76.9.A43 V39 2001".
- catalog tableOfContents "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.".
- catalog title "Approximation algorithms / Vijay V. Vazirani.".
- catalog type "text".