HAPPY HOLIDAYS: Get a special discount on Apress Access! Subscribe today >>

Texts in Theoretical Computer Science. An EATCS Series

Exact Exponential Algorithms

Authors: Fomin, Fedor V., Kratsch, Dieter

  • Classroom-tested by the authors and their collaborators
  • Exercises and notes for further reading support the text throughout
  • Provides a comprehensive introduction for researchers
see more benefits

Buy this book

eBook $54.99
price for USA
  • ISBN 978-3-642-16533-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $69.95
price for USA
  • ISBN 978-3-642-16532-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $69.95
price for USA
  • ISBN 978-3-642-26566-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

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 authors

The authors are highly regarded academics and educators in theoretical computer science, and in algorithmics in particular.

Table of contents (12 chapters)

Buy this book

eBook $54.99
price for USA
  • ISBN 978-3-642-16533-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $69.95
price for USA
  • ISBN 978-3-642-16532-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $69.95
price for USA
  • ISBN 978-3-642-26566-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Bibliographic Information

Bibliographic Information
Book Title
Exact Exponential Algorithms
Authors
Series Title
Texts in Theoretical Computer Science. An EATCS Series
Copyright
2010
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-16533-7
DOI
10.1007/978-3-642-16533-7
Hardcover ISBN
978-3-642-16532-0
Softcover ISBN
978-3-642-26566-2
Series ISSN
1862-4499
Edition Number
1
Number of Pages
XIV, 206
Number of Illustrations and Tables
38 b/w illustrations
Topics