Algorithms - 08 edition
Algorithms - 08 edition
by Sanjoy Dasgupta, Christos H. Papadimitriou and Umesh Vazirani
Cover type: PaperbackEdition: 08
Copyright: 2008
Publisher: McGraw-Hill Publishing Company
Published: 2008
International: No
List price: $56.50
Instant access, flexible term options, and deep discounts up to 60% on digital content! Happy you, happy us.
Summary
New Features
- SPRINKLED WITH interesting stories about the development of important algorithms AS WELL AS ABOUT THEIR CURRENT USES IN THE GLOBAL INFORMATION ENVIRONMENT.
- The book is concise and realistic; with key Design Issues and rationales that clearly outline the problems to be solveD and show how to develop the algorithm...
- Self contained chapters that provide a variety of perspectives on the implementation of algorithms The authors cover THE essential algorithms that students need to know, but are also thorough and rigorous; including coverage of linear programming and quantum computing (BOTH optional, BUT COVERED IN NO OTHER BOOK).
- This is a highly flexible text with self contained chapters: some simple and others high level; that provide a variety of perspectives on the analysis and design of algorithms. Carefully class tested at UCSD and UC Berkeley OVER 10 YEARS.
- The book uses a unique approach for proofs and is intuitive and accessible.
Table of Contents
0 Prologue
1 Algorithms with Numbers
2 Divide-and-conquer algorithms
3 Decompositions of graphs
4 Paths in graphs
5 Greedy algorithms
6 Dynamic Programming
7 Linear Programming and Reductions
8 NP-complete Problems
9 Coping with NP-completeness
10 Quantum Algorithms
Minimum System Requirements:
- Windows 7/8, or Mac OS X 10.6 or above
eTextbooks and eChapters can be viewed by using the free reader listed below.
Be sure to check the format of the eTextbook/eChapter you purchase to know which reader you will need. After purchasing your eTextbook or eChapter, you will be emailed instructions on where and how to download your free reader.
Download Requirements:Due to the size of eTextbooks, a high-speed Internet connection (cable modem, DSL, LAN) is required for download stability and speed. Your connection can be wired or wireless.
Being online is not required for reading an eTextbook after successfully downloading it. You must only be connected to the Internet during the download process.
User Help:
Click Here to access the VitalSource Bookshelf FAQ
Copying: Allowed, 2 selections may be copied daily for 180 days
Printing: Allowed, 2 prints daily for 180 days
Expires: Yes, may be used for 180 days after activation
Reading Aloud: Allowed
Sharing: Not Allowed
Min. Software Version: Online: No additional software required
Offline: VitalSource Bookshelf
Suitable Devices: PCs, Tablet PCs, Macs, Laptops
Digital Rights Management (DRM) Key
Copying - Books that cannot be copied will show "Not Allowed." Otherwise, this will detail the number of times it can be copied, or "Allowed with no limits."
Printing - Books that cannot be printed will show "Not Allowed." Otherwise, this will detail the number of times it can be printed, or "Allowed with no limits."
Expires - Books that have no expiration (the date upon which you will no longer be able to access your eBook) will read "No Expiration." Otherwise it will state the number of days from activation (the first time you actually read it).
Reading Aloud - Books enabled with the "text-to-speech" feature so that they can be read aloud will show "Allowed."
Sharing - Books that cannot be shared with other computers will show "Not Allowed."
Min. Software Version - This is the minimum software version needed to read this book.
Suitable Devices - Hardware known to be compatible with this book. Note: Reader software still needs to be installed.
Shop Us With Confidence
bartleby+ More
Your order qualifies for 1 FREE MONTH of
Algorithms
Expertly curated help for
Algorithms.
Get access to 5+ million textbook and homework solutions, access to subject matter experts, math solver, and premium writing tools with bartleby+. Get your 1st month free.*
* After trial, subscription auto-renews for $11.99/month. Cancel any time.
New Features
- SPRINKLED WITH interesting stories about the development of important algorithms AS WELL AS ABOUT THEIR CURRENT USES IN THE GLOBAL INFORMATION ENVIRONMENT.
- The book is concise and realistic; with key Design Issues and rationales that clearly outline the problems to be solveD and show how to develop the algorithm...
- Self contained chapters that provide a variety of perspectives on the implementation of algorithms The authors cover THE essential algorithms that students need to know, but are also thorough and rigorous; including coverage of linear programming and quantum computing (BOTH optional, BUT COVERED IN NO OTHER BOOK).
- This is a highly flexible text with self contained chapters: some simple and others high level; that provide a variety of perspectives on the analysis and design of algorithms. Carefully class tested at UCSD and UC Berkeley OVER 10 YEARS.
- The book uses a unique approach for proofs and is intuitive and accessible.
0 Prologue
1 Algorithms with Numbers
2 Divide-and-conquer algorithms
3 Decompositions of graphs
4 Paths in graphs
5 Greedy algorithms
6 Dynamic Programming
7 Linear Programming and Reductions
8 NP-complete Problems
9 Coping with NP-completeness
10 Quantum Algorithms
Minimum System Requirements:
- Windows 7/8, or Mac OS X 10.6 or above
eTextbooks and eChapters can be viewed by using the free reader listed below.
Be sure to check the format of the eTextbook/eChapter you purchase to know which reader you will need. After purchasing your eTextbook or eChapter, you will be emailed instructions on where and how to download your free reader.
Download Requirements:Due to the size of eTextbooks, a high-speed Internet connection (cable modem, DSL, LAN) is required for download stability and speed. Your connection can be wired or wireless.
Being online is not required for reading an eTextbook after successfully downloading it. You must only be connected to the Internet during the download process.
User Help:
Click Here to access the VitalSource Bookshelf FAQ
Copying: Allowed, 2 selections may be copied daily for 180 days
Printing: Allowed, 2 prints daily for 180 days
Expires: Yes, may be used for 180 days after activation
Reading Aloud: Allowed
Sharing: Not Allowed
Min. Software Version: Online: No additional software required
Offline: VitalSource Bookshelf
Suitable Devices: PCs, Tablet PCs, Macs, Laptops
Digital Rights Management (DRM) Key
Copying - Books that cannot be copied will show "Not Allowed." Otherwise, this will detail the number of times it can be copied, or "Allowed with no limits."
Printing - Books that cannot be printed will show "Not Allowed." Otherwise, this will detail the number of times it can be printed, or "Allowed with no limits."
Expires - Books that have no expiration (the date upon which you will no longer be able to access your eBook) will read "No Expiration." Otherwise it will state the number of days from activation (the first time you actually read it).
Reading Aloud - Books enabled with the "text-to-speech" feature so that they can be read aloud will show "Allowed."
Sharing - Books that cannot be shared with other computers will show "Not Allowed."
Min. Software Version - This is the minimum software version needed to read this book.
Suitable Devices - Hardware known to be compatible with this book. Note: Reader software still needs to be installed.
Published: 2008
International: No
Summary
New Features
- SPRINKLED WITH interesting stories about the development of important algorithms AS WELL AS ABOUT THEIR CURRENT USES IN THE GLOBAL INFORMATION ENVIRONMENT.
- The book is concise and realistic; with key Design Issues and rationales that clearly outline the problems to be solveD and show how to develop the algorithm...
- Self contained chapters that provide a variety of perspectives on the implementation of algorithms The authors cover THE essential algorithms that students need to know, but are also thorough and rigorous; including coverage of linear programming and quantum computing (BOTH optional, BUT COVERED IN NO OTHER BOOK).
- This is a highly flexible text with self contained chapters: some simple and others high level; that provide a variety of perspectives on the analysis and design of algorithms. Carefully class tested at UCSD and UC Berkeley OVER 10 YEARS.
- The book uses a unique approach for proofs and is intuitive and accessible.
Table of Contents
Table of Contents
0 Prologue
1 Algorithms with Numbers
2 Divide-and-conquer algorithms
3 Decompositions of graphs
4 Paths in graphs
5 Greedy algorithms
6 Dynamic Programming
7 Linear Programming and Reductions
8 NP-complete Problems
9 Coping with NP-completeness
10 Quantum Algorithms
Digital Rights
Minimum System Requirements:
- Windows 7/8, or Mac OS X 10.6 or above
eTextbooks and eChapters can be viewed by using the free reader listed below.
Be sure to check the format of the eTextbook/eChapter you purchase to know which reader you will need. After purchasing your eTextbook or eChapter, you will be emailed instructions on where and how to download your free reader.
Download Requirements:Due to the size of eTextbooks, a high-speed Internet connection (cable modem, DSL, LAN) is required for download stability and speed. Your connection can be wired or wireless.
Being online is not required for reading an eTextbook after successfully downloading it. You must only be connected to the Internet during the download process.
User Help:
Click Here to access the VitalSource Bookshelf FAQ
Copying: Allowed, 2 selections may be copied daily for 180 days
Printing: Allowed, 2 prints daily for 180 days
Expires: Yes, may be used for 180 days after activation
Reading Aloud: Allowed
Sharing: Not Allowed
Min. Software Version: Online: No additional software required
Offline: VitalSource Bookshelf
Suitable Devices: PCs, Tablet PCs, Macs, Laptops
Digital Rights Management (DRM) Key
Copying - Books that cannot be copied will show "Not Allowed." Otherwise, this will detail the number of times it can be copied, or "Allowed with no limits."
Printing - Books that cannot be printed will show "Not Allowed." Otherwise, this will detail the number of times it can be printed, or "Allowed with no limits."
Expires - Books that have no expiration (the date upon which you will no longer be able to access your eBook) will read "No Expiration." Otherwise it will state the number of days from activation (the first time you actually read it).
Reading Aloud - Books enabled with the "text-to-speech" feature so that they can be read aloud will show "Allowed."
Sharing - Books that cannot be shared with other computers will show "Not Allowed."
Min. Software Version - This is the minimum software version needed to read this book.
Suitable Devices - Hardware known to be compatible with this book. Note: Reader software still needs to be installed.
