عنوان

The design of approximation algorithms /

شابک

0521195276

شابک

9780521195270

شماره

dltt

عنوان اصلي

The design of approximation algorithms /

نام عام مواد

[Book]

نام نخستين پديدآور

David P. Williamson, David B. Shmoys

نام خاص و کميت اثر

xi, 504 pages :

ساير جزييات

illustrations,

ابعاد

26 cm

متن يادداشت

Includes bibliographical references and indexes

متن يادداشت

"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

شماره

ويراست

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

Williamson, David P

مستند نام اشخاص تاييد نشده

Shmoys, David Bernard

تاريخ عمليات

20110804233220.0

قواعد فهرست نويسي ( بخش توصيفي )

rda

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y