Items related to Exact Exponential Algorithms (Texts in Theoretical...
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.
"synopsis" may belong to another edition of this title.
From the Back Cover:
About the Author:
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.
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 date2010
- ISBN 10 364216532X
- ISBN 13 9783642165320
- BindingHardcover
- Number of pages220
Buy New
Learn more about this copy
US$ 107.38
Shipping:
FREE
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Stock Image
Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)
Seller:
Rating
Book Description Condition: New. Book is in NEW condition. Seller Inventory # 364216532X-2-1
Buy New
US$ 107.38
Convert currency
Stock Image
Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)
Seller:
Rating
Book Description Condition: New. New! This book is in the same immaculate condition as when it was published. Seller Inventory # 353-364216532X-new
Buy New
US$ 107.39
Convert currency
Seller Image
Exact Exponential Algorithms
Published by
Springer Berlin Heidelberg Okt 2010
(2010)
ISBN 10: 364216532X
ISBN 13: 9783642165320
New
Hardcover
Quantity: 2
Seller:
Rating
Book Description Buch. 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 # 9783642165320
Buy New
US$ 82.75
Convert currency
Seller Image
Exact Exponential Algorithms
Published by
Springer Berlin Heidelberg
(2010)
ISBN 10: 364216532X
ISBN 13: 9783642165320
New
Hardcover
Quantity: 1
Seller:
Rating
Book Description Buch. 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 # 9783642165320
Buy New
US$ 87.61
Convert currency
Seller Image
Exact Exponential Algorithms
Published by
Springer Berlin Heidelberg
(2010)
ISBN 10: 364216532X
ISBN 13: 9783642165320
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Gebunden. 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 # 5051181
Buy New
US$ 76.11
Convert currency