عنوان

The design of approximation algorithms /

(Number (ISBN

0521195276

(Number (ISBN

9780521195270

Number

dltt

Title Proper

The design of approximation algorithms /

General Material Designation

[Book]

First Statement of Responsibility

David P. Williamson, David B. Shmoys

Specific Material Designation and Extent of Item

xi, 504 pages :

Other Physical Details

illustrations,

Dimensions

26 cm

Text of Note

Includes bibliographical references and indexes

Text of Note

"Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. 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 part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems"--

Approximation theory

Mathematical optimization

Number

Edition

Class number

Book number

Williamson, David P

Shmoys, David Bernard

Date of Transaction

20110804233220.0

Cataloguing Rules (Descriptive Conventions))

rda

Electronic name

[Book]

Y