Items related to The Design of Approximation Algorithms
Synopsis
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.
"synopsis" may belong to another edition of this title.
About the Authors
David P. Williamson is a Professor at Cornell University with a joint appointment in the School of Operations Research and Information Engineering and in the Department of Information Science. Prior to joining Cornell, he was a Research Staff Member at the IBM T. J. Watson Research Center and a Senior Manager at the IBM Almaden Research Center. He has won several awards for his work on approximation algorithms, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. He has served on several editorial boards, including ACM Transactions on Algorithms, Mathematics of Operations Research, the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics.
David Shmoys has faculty appointments in both the School of Operations Research and Information Engineering and the Department of Computer Science, and he is currently Associate Director of the Institute for Computational Sustainability at Cornell University. He is a Fellow of the ACM, was an NSF Presidential Young Investigator, and has served on numerous editorial boards, including Mathematics of Operations Research (for which he is currently an associate editor), Operations Research, the ORSA Journal on Computing, Mathematical Programming and both the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics; he also served as editor-in-chief for the latter.
"About this title" may belong to another edition of this title.
Search results for The Design of Approximation Algorithms
Stock Image
The Design of Approximation Algorithms
Published by
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
Used
Hardcover
First Edition
Seller: Prior Books Ltd, Cheltenham, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Like New. First Edition. A firm, square and tight hardback with strong joints, just showing a few very bumps and some mild cosmetic wear. Hence a non-text page is stamped 'damaged'. Despite such this book is actually in nearly new condition. Thus the contents are crisp, fresh and clean with no pen-marks. Not from a library so no such stamps or labels. Now offered for sale at a very reasonable price. Seller Inventory # 209280
Quantity: 2 available
Seller Image
Design of Approximation Algorithms
Published by
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
New
Hardcover
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 11863595-n
Quantity: Over 20 available
Stock Image
The Design of Approximation Algorithms
Published by
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
New
Hardcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521195270_new
Quantity: Over 20 available
Stock Image
The Design of Approximation Algorithms
Published by
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
New
Hardcover
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 1100. Seller Inventory # C9780521195270
Quantity: Over 20 available
Stock Image
The Design of Approximation Algorithms (Hardcover)
Published by
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
New
Hardcover
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. Designed as a textbook for graduate courses on algorithms, this book will also serve as a reference for researchers interested in heuristic solutions of discrete optimization problems. It presents central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521195270
Quantity: 1 available
Seller Image
Design of Approximation Algorithms
Published by
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
Used
Hardcover
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 11863595
Quantity: Over 20 available
Stock Image
The Design of Approximation Algorithms
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock. This item is printed on demand. Seller Inventory # __0521195276
Quantity: 1 available
Seller Image
Design of Approximation Algorithms
Published by
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
New
Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 11863595-n
Quantity: Over 20 available
Stock Image
The Design of Approximation Algorithms
Published by
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
New
Hardcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521195270
Quantity: Over 20 available
Stock Image
The Design of Approximation Algorithms
Published by
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
New
Hardcover
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. pp. xi + 504 Illus. Seller Inventory # 5369144
Quantity: 1 available