The design of approximation algorithms / (Record no. 54403)

MARC details
000 -LEADER
fixed length control field 02452cam a22003374a 4500
001 - CONTROL NUMBER
control field 16611561
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200123105008.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 110114s2011 nyua b 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2011001945
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780521195270 (hardback)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0521195276 (hardback)
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)ocn671709856
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Transcribing agency DLC
Modifying agency YDX
-- BTCTA
-- YDXCP
-- CDX
-- GIKBM
-- DLC
042 ## - AUTHENTICATION CODE
Authentication code pcc
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA221
Item number .W55 2011
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.5 WIL-D
Edition number 22
084 ## - OTHER CLASSIFICATION NUMBER
Classification number COM051300
Number source bisacsh
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Williamson, David P.
245 14 - TITLE STATEMENT
Title The design of approximation algorithms /
Statement of responsibility, etc. David P. Williamson, David B. Shmoys.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. New York :
Name of publisher, distributor, etc. Cambridge University Press,
Date of publication, distribution, etc. 2011.
300 ## - PHYSICAL DESCRIPTION
Extent xi, 504 p. :
Other physical details ill. ;
Dimensions 26 cm.
365 ## - TRADE PRICE
Price type code GBP
Price amount 51.99
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and indexes.
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"--
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Approximation theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical optimization.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Shmoys, David Bernard.
856 42 - ELECTRONIC LOCATION AND ACCESS
Materials specified Cover image
Uniform Resource Identifier <a href="http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg">http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg</a>
906 ## - LOCAL DATA ELEMENT F, LDF (RLIN)
a 7
b cbc
c orignew
d 1
e ecip
f 20
g y-gencatlg
955 ## - COPY-LEVEL INFORMATION (RLIN)
Book number/undivided call number, CCAL (RLIN) re10 2011-01-14
Copy information and material description, CCAL + MDES (RLIN) re10 2011-01-14 ONIX to STM
Classification number, CCAL (RLIN) bc05 2011-06-21 1 copy rec'd., to CIP ver.
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
Withdrawn status
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
Withdrawn status
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
Withdrawn status
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
Withdrawn status
Holdings
Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Total Checkouts Total Renewals Full call number Barcode Date last seen Date last checked out Price effective from Koha item type
  Dewey Decimal Classification     510 BITS Pilani Hyderabad BITS Pilani Hyderabad Text & Reference Section (Student cannot borrow these books) 23/01/2020 2 2 518.5 WIL-D 40174 13/07/2024 26/05/2022 23/01/2020 Course Text Book
  Dewey Decimal Classification     510 BITS Pilani Hyderabad BITS Pilani Hyderabad Text & Reference Section (Student cannot borrow these books) 29/01/2022     518.5 WIL-D 44714 13/07/2024   29/01/2022 Course Text Book
  Dewey Decimal Classification     510 BITS Pilani Hyderabad BITS Pilani Hyderabad Text & Reference Section (Student cannot borrow these books) 29/01/2022 1   518.5 WIL-D 44715 31/07/2024 27/02/2024 29/01/2022 Course Text Book
  Dewey Decimal Classification     510 BITS Pilani Hyderabad BITS Pilani Hyderabad Text & Reference Section (Student cannot borrow these books) 29/01/2022     518.5 WIL-D 44716 13/07/2024   29/01/2022 Course Text Book
An institution deemed to be a University Estd. Vide Sec.3 of the UGC
Act,1956 under notification # F.12-23/63.U-2 of Jun 18,1964

© 2024 BITS-Library, BITS-Hyderabad, India.