## Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

### Fedor V. Fomin; Dieter Kratsch

4.5 avg rating
( 2 ratings by Goodreads )

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:

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.

List Price: US\$ 69.95
US\$ 61.17

Shipping: US\$ 3.99
Within U.S.A.

Destination, Rates & Speeds

## 1.Exact Exponential Algorithms

ISBN 10: 364216532X ISBN 13: 9783642165320
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2010. HRD. Book Condition: New. New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IP-9783642165320

US\$ 61.17
Convert Currency
Shipping: US\$ 3.99
Within U.S.A.
Destination, Rates & Speeds

## 2.Exact Exponential Algorithms

ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover Quantity Available: > 20
Seller:
Blackwell's
(Oxford, OX, United Kingdom)
Rating

Book Description Springer Berlin Heidelberg 2010-10-27, Berlin |London, 2010. hardback. Book Condition: New. Bookseller Inventory # 9783642165320

US\$ 66.80
Convert Currency
Shipping: US\$ 4.05
From United Kingdom to U.S.A.
Destination, Rates & Speeds

## 3.Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover Quantity Available: > 20
Print on Demand
Seller:
Murray Media
(North Miami Beach, FL, U.S.A.)
Rating

Book Description Springer, 2017. Hardcover. Book Condition: New. Never used! This item is printed on demand. Bookseller Inventory # 364216532X

US\$ 75.33
Convert Currency
Shipping: US\$ 1.99
Within U.S.A.
Destination, Rates & Speeds

## 4.Exact Exponential Algorithms

ISBN 10: 364216532X ISBN 13: 9783642165320
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2010. HRD. Book Condition: New. New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000. Bookseller Inventory # IP-9783642165320

US\$ 65.52
Convert Currency
Shipping: US\$ 12.16
From United Kingdom to U.S.A.
Destination, Rates & Speeds

## 5.Exact Exponential Algorithms

ISBN 10: 364216532X ISBN 13: 9783642165320
New Paperback Quantity Available: 1
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating

Book Description Springer, 2016. Paperback. Book Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Bookseller Inventory # ria9783642165320_lsuk

US\$ 73.23
Convert Currency
Shipping: US\$ 5.23
From United Kingdom to U.S.A.
Destination, Rates & Speeds

## 6.Exact Exponential Algorithms

ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover Quantity Available: 1
Seller:
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating

Book Description Springer, 2010. Hardback. Book Condition: NEW. 9783642165320 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Bookseller Inventory # HTANDREE0354422

US\$ 69.60
Convert Currency
Shipping: US\$ 10.81
From United Kingdom to U.S.A.
Destination, Rates & Speeds

## 7.Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover Quantity Available: 1
Seller:
Irish Booksellers
(Rumford, ME, U.S.A.)
Rating

Book Description Springer, 2010. Hardcover. Book Condition: New. book. Bookseller Inventory # M364216532X

US\$ 86.78
Convert Currency
Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

## 8.Exact Exponential Algorithms

ISBN 10: 364216532X ISBN 13: 9783642165320
New Quantity Available: 1
Seller:
Rating

Book Description Springer-Verlag Gmbh Nov 2010, 2010. Buch. Book Condition: Neu. 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. 203 pp. Englisch. Bookseller Inventory # 9783642165320

US\$ 72.62
Convert Currency
Shipping: US\$ 14.40
From Germany to U.S.A.
Destination, Rates & Speeds

## 9.Exact Exponential Algorithms

ISBN 10: 364216532X ISBN 13: 9783642165320
New Softcover Quantity Available: 1
Seller:
Rating

Book Description 2010. Book Condition: New. Bookseller Inventory # L9783642165320

US\$ 84.74
Convert Currency
Shipping: US\$ 3.59
From Germany to U.S.A.
Destination, Rates & Speeds

## 10.Exact Exponential Algorithms: Exact Exponential Algorithms

ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover Quantity Available: 2
Seller:
Revaluation Books
(Exeter, United Kingdom)
Rating

Book Description Springer Pub Co, 2010. Hardcover. Book Condition: Brand New. 1st edition. edition. 204 pages. 9.20x6.10x0.70 inches. In Stock. Bookseller Inventory # __364216532X