Items related to Exact Exponential Algorithms (Texts in Theoretical...
Synopsis
Exact Exponential Algorithms provides an introduction to the area and explains the most common algorithmic techniques involved. Thorough exercises are included, in addition to notes and suggestions for further reading.
"synopsis" may belong to another edition of this title.
From the Back Cover
Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, brute-force methods? The algorithms that address these questions are known as exact exponential algorithms.
The history of exact exponential algorithms for NP-hard problems dates back to the 1960s. The two classical examples are Bellman, Held and Karp’s dynamic programming algorithm for the traveling salesman problem and Ryser’s inclusion–exclusion formula for the permanent of a matrix. The design and analysis of exact algorithms leads to a better understanding of hard problems and initiates interesting new combinatorial and algorithmic challenges. The last decade has witnessed a rapid development of the area, with many new algorithmic techniques discovered. This has transformed exact algorithms into a very active research field. This book provides an introduction to the area and explains the most common algorithmic techniques, and the text is supported throughout with exercises and detailed notes for further reading.
The book is intended for advanced students and researchers in computer science, operations research, optimization and combinatorics.
About the Author
The authors are highly regarded academics and educators in theoretical computer science, and in algorithmics in particular.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2012
- ISBN 10 3642265669
- ISBN 13 9783642265662
- BindingPaperback
- LanguageEnglish
- Number of pages220
Other Popular Editions of the Same Title
Search results for Exact Exponential Algorithms (Texts in Theoretical...
Seller Image
Exact Exponential Algorithms
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 19283327
Quantity: Over 20 available
Seller Image
Exact Exponential Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 19283327
Quantity: Over 20 available
Seller Image
Exact Exponential Algorithms
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 19283327-n
Quantity: Over 20 available
Seller Image
Exact Exponential Algorithms
Published by
Springer Berlin Heidelberg Dez 2012, 2012
ISBN 10: 3642265669
ISBN 13: 9783642265662
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able De nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING. 220 pp. Englisch. Seller Inventory # 9783642265662
Quantity: 2 available
Stock Image
Exact Exponential Algorithms
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 220. Seller Inventory # 2654503538
Quantity: 4 available
Seller Image
Exact Exponential Algorithms
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642265669
ISBN 13: 9783642265662
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able De nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING. Seller Inventory # 9783642265662
Quantity: 1 available
Seller Image
Exact Exponential Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 19283327-n
Quantity: Over 20 available
Stock Image
Exact Exponential Algorithms
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 220 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 55056301
Quantity: 4 available
Stock Image
Exact Exponential Algorithms
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 220. Seller Inventory # 1854503544
Quantity: 4 available
Seller Image
Exact Exponential Algorithms
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642265669
ISBN 13: 9783642265662
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Textbook has been class-tested by the authors and their collaboratorsText is supported throughout with exercises and notes for further readingComprehensive introduction for researchersComprehensive introduction for researchersTh. Seller Inventory # 5054622
Quantity: Over 20 available