The design of approximation algorithms / David P. Williamson [and] David B. Shmoys

Bibliographic Detail #48313

Brief |Full |MARC

Preview Add Tag Add To List Share Suggest Request Save Export Citation

Rate

Material Type

Books

Title	The design of approximation algorithms / David P. Williamson [and] David B. Shmoys
LC Call #	QA221 W55 2011
Author	Williamson, David P.
Added Author	Shmoys, David B.
Content	An introduction to approximation algorithms
	Greedy algorithms and local search
	Rounding data and dynamic programming
	Deterministic rounding of linear programs
	Random sampling and randomized rounding of linear programs
	Randomized rounding of semidefinite programs
	The primal-dual method
	Cuts and metrics
	Further uses of greedy and local search algorithms
	Further uses of rounding data and dynamic programming
	Further uses of deterministic rounding of linear programs
	Further uses of random sampling and randomized rounding of linear programs
	Further uses of randomized rounding of semidefinite programs
	Further uses of the primal-dual method
	Further uses of cuts and metrics
	Techniques in proving the hardness of approximation
	Open problems
Subject	Mathematical optimization
	Approximation theory
ISBN	978-0-521-19527-0 Hardback
Published/Created	Cambridge, New York : Cambridge University Press, 2011.

Items | Order

Select Branch :

	Barcode	CallNo	Collection	Branch	Location	Status
	33002000032059	QA221 W55 2011	Book	PSU Phuket Campus Library	Foreign Book (2nd Fl.)	Available

Library	Ordered Date	Copies	Status
PSU Phuket Campus Library	20 Sep 2013	1	Completely Received

Comment |Review

Add Comment Dialog

Your Name

Comment

Add Review Dialog

Your Name

Content

Add to list

Title

Create in

Use same folder

Create a Folder

Folder Name

Add to list result

Hold Dialog

Branch Receive

Expected Date Received

Request Inprocess Items

เงื่อนไข

ติดต่อสอบถามข้อมูลเพิ่มเติม โทร. 2352

Items Location Map