Library - International Centre for Theoretical Sciences catalog

Normal view MARC view ISBD view

Algorithm design

By: Kleinberg, JonContributor(s): Tardos, EvaMaterial type: Text

TextPublication details: London: Pearson Education Inc [c2006]Description: 824 pISBN: 9789332518643LOC classification: QA76.9.A43

Contents:

1. Introduction: Some Representative Problems 2. Basics of Algorithm Analysis 3. Graphs 4. Greedy Algorithms 5. Divide and Conquer 6. Dynamic Programming 7. Network Flow 8. NP and Computational Intractability 9. PSPACE: A Class of Problems beyond NP 10. Extending the Limits of Tractability 11. Approximation Algorithms 12.Local Search 13. Randomized Algorithms

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 1 )
Comments ( 0 )

Item type	Current library	Collection	Shelving location	Call number	Status	Notes	Date due	Barcode	Item holds
Book	ICTS	Mathematic	Rack No 3	QA76.9.A43 (Browse shelf (Opens below))	Available	Billno:94840; Billdate: 2016-07-06		00242

Total holds: 0

Browsing ICTS shelves, Shelving location: Rack No 3 Close shelf browser (Hides shelf browser)

Previous								Next
Previous	QA76.87 .S745 Deep learning with PyTorch	QA76.9 Matrix methods in data mining and pattern recognition	QA76.9 The model thinker : what you need to know to make data work for you	QA76.9.A43 Algorithm design	QA76.9.M35 Discrete mathematics : proceedings of the international conference on discrete mathematics, Indian Institute of Science, Bangalore, December 2006	QA76.9.M35 Advances in discrete mathematics and applications: Mysore 2008	QA76.9.M35 Discrete mathematics : proceedings of the international conference on discrete mathematics, Indian Institute of Science, Bangalore, December 2006	Next

1. Introduction: Some Representative Problems
2. Basics of Algorithm Analysis
3. Graphs
4. Greedy Algorithms
5. Divide and Conquer
6. Dynamic Programming
7. Network Flow
8. NP and Computational Intractability
9. PSPACE: A Class of Problems beyond NP
10. Extending the Limits of Tractability
11. Approximation Algorithms
12.Local Search
13. Randomized Algorithms

There are no comments on this title.

to post a comment.