The design of approximation algorithms (Record no. 6651)

MARC details
000 -LEADER
fixed length control field 02397nam a22002057a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240227172758.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240227b |||||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780521195270
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519.65
Item number WIL
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Williamson, David P.
245 ## - TITLE STATEMENT
Title The design of approximation algorithms
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc. Cambridge University Press
Place of publication, distribution, etc. New York
Date of publication, distribution, etc. 2011
300 ## - PHYSICAL DESCRIPTION
Extent xi, 504 p.
365 ## - TRADE PRICE
Price type code GBP
Price amount 58.99
520 ## - SUMMARY, ETC.
Summary, etc. 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.<br/><br/>Can be used as a textbook, but also as a way for students to get the background to read current research in the area of approximation algorithms<br/>Explores the heuristic solution of discrete optimization problems<br/>Explains the principles of designing approximation algorithms, around algorithmic ideas that have been used in different ways and applied to different optimization problems<br/><br/>(https://www.cambridge.org/us/universitypress/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/design-approximation-algorithms?format=HB&isbn=9780521195270)
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Approximation theory
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical optimization
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Shmoys, David B.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Book
Source of classification or shelving scheme Dewey Decimal Classification
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Bill No Bill Date Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Full call number Accession Number Date last seen Copy number Cost, replacement price Price effective from Koha item type
    Dewey Decimal Classification     Operations Management & Quantitative Techniques TB3912 22-02-2024 Indian Institute of Management LRC Indian Institute of Management LRC General Stacks 02/27/2024 Technical Bureau India Pvt. Ltd. 4217.78   519.65 WIL 006255 02/27/2024 1 6488.90 02/27/2024 Book

©2019-2020 Learning Resource Centre, Indian Institute of Management Bodhgaya

Powered by Koha