Order Total (1 Item Items):
Shipping Destination:
Design Approximation Algorithms by Williamson David (21 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (21)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
Binding
- All Bindings
- Hardcover (21)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (6)
- Not Print on Demand (16)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
Condition: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
-
Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 84.11
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 82.77
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 78.86
Convert currencyUS$ 15.79 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
Condition: New.
-
Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 97.99
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
The Design of Approximation Algorithms (Hardcover)
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
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 multiple locations in the US or from the UK, depending on stock availability.
-
Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 83.17
Convert currencyUS$ 19.77 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 103.28
Convert currencyUS$ 9.99 shipping from Canada to U.S.A.Quantity: Over 20 available
Add to basketHardcover. Condition: New. Illustrated. Special order direct from the distributor.
-
Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 99.78
Convert currencyUS$ 19.77 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
The Design of Approximation Algorithms
Published by Cambridge University Press CUP, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
Condition: New. pp. xi + 504 1st Edition.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 105.48
Convert currencyUS$ 37.49 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
US$ 132.82
Convert currencyUS$ 13.18 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock.
-
The Design of Approximation Algorithms (Hardcover)
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 97.71
Convert currencyUS$ 48.76 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. 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.
-
The Design of Approximation Algorithms (Hardcover)
Published by Cambridge University Press, Cambridge, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 124.70
Convert currencyUS$ 37.00 shipping from Australia to U.S.A.Quantity: 1 available
Add to basketHardcover. 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 Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 157.45
Convert currencyUS$ 32.94 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
US$ 92.84
Convert currencyUS$ 13.18 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock. This item is printed on demand.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 95.92
Convert currencyUS$ 23.39 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 1100.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 120.97
Convert currencyUS$ 8.57 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. xi + 504 Illus.
-
US$ 83.35
Convert currencyUS$ 54.36 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 a.
-
The Design of Approximation Algorithms
Published by Cambridge University Press, 2011
ISBN 10: 0521195276 ISBN 13: 9780521195270
Language: English
US$ 130.14
Convert currencyUS$ 11.04 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. xi + 504.
