Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Exact Exponential Algorithms

by Fedor V. Fomin
Save 35% Save 35%
Current price ₹5,458.00
Original price ₹8,396.00
Original price ₹8,396.00
Original price ₹8,396.00
(-35%)
₹5,458.00
Current price ₹5,458.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9783642165320
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 206
  • Original Price: EUR 74.99
  • Language: English
  • Edition: 2010
  • Item Weight: 339 grams
  • BISAC Subject(s): Computer Science, Combinatorics, and Linear & Nonlinear Programming

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us