Design Approximation Algorithms by Williamson David (22 results)
- Hardcover
Seller: clickgoodwillbooks, Indianapolis, IN, U.S.A.clickgoodwillbooks
Contact seller5-star sellerCondition: Used - Fair
US$ 49.10
US$ 3.99 shippingShips within U.S.A.Quantity: 1 available
Condition: acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media.
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 94.35
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
US$ 97.00
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 97.94
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 91.70
US$ 15.87 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 91.69
US$ 19.88 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.Rarewaves USA
Contact seller5-star sellerCondition: New
US$ 113.42
Free ShippingShips within U.S.A.Quantity: Over 20 available
Hardback. Condition: New. 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 t…o 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.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 105.14
US$ 19.88 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
US$ 127.88
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: New. 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 t…o 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.
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 134.70
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. xi + 504 1st Edition.
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 139.74
US$ 19.88 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock.
- Hardcover
Seller: Rarewaves USA United, OSWEGO, IL, U.S.A.Rarewaves USA United
Contact seller5-star sellerCondition: New
US$ 119.21
US$ 50.00 shippingShips within U.S.A.Quantity: Over 20 available
Hardback. Condition: New. 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 t…o 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.
- Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
US$ 176.41
US$ 10.50 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New. 2011. 1st Edition. Hardcover. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Num Pages: 518 pages, 86 b/w illus. 121 exercises. BIC Classification: PBU; UMB; UMZ. Category: (U) Tertiary Education (US: College). Dimensio…n: 256 x 186 x 32. Weight in Grams: 1154. 516 pages, 86 b/w illus. 121 exercises. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Cateogry: (U) Tertiary Education (US: College). BIC Classification: PBU; UMB; UMZ. Dimension: 256 x 186 x 32. Weight: 1086. . . . . . Books ship from the US and Ireland.
- Hardcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 123.40
US$ 86.13 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: New. 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 t…o 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.
- Hardcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
US$ 182.88
US$ 33.13 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Hardcover
- First Edition
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
US$ 212.95
US$ 11.98 shippingShips from Ireland to U.S.A.Quantity: Over 20 available
Condition: New. 2011. 1st Edition. Hardcover. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Num Pages: 518 pages, 86 b/w illus. 121 exercises. BIC Classification: PBU; UMB; UMZ. Category: (U) Tertiary Education (US: College). Dimensio…n: 256 x 186 x 32. Weight in Grams: 1154. 516 pages, 86 b/w illus. 121 exercises. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Cateogry: (U) Tertiary Education (US: College). BIC Classification: PBU; UMB; UMZ. Dimension: 256 x 186 x 32. Weight: 1086. . . . . .
- Hardcover
- Print on Demand
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 97.87
US$ 19.88 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock. This item is printed on demand.
- Hardcover
- Print on Demand
Seller: THE SAINT BOOKSTORE, Southport, United KingdomTHE SAINT BOOKSTORE
Contact seller5-star sellerCondition: New
US$ 102.37
US$ 28.82 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Hardcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 136.58
US$ 8.61 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. xi + 504 Illus.
- Hardcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
US$ 103.71
US$ 49.03 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
- Hardcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 146.32
US$ 11.36 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. xi + 504.
- Hardcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 102.96
US$ 55.91 shippingShips from Germany to U.S.A.Quantity: Over 20 available
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.
