Home/
Combinatorial Algorithms: Generation, Enumeration, and Search
Combinatorial Algorithms: Generation, Enumeration, and Search
No customer reviews yet
ISBN 9780367400156
- Published
- Nov 2019
- Language
- English
$103.21
In stock
Most orders arrive within 3 weeks. Shipping policy
Sign in to Add to Saved list
Fast checkout
Pay with Apple Pay or Google Pay when available.
Payment received
We are registering your order now. Please stay on this page while we redirect you to the confirmation page.
Free delivery over $35 · 15-day returns
Condition
Brand New
An unread, unused copy: no writing or highlighting, and no missing or damaged pages. Every book we sell is brand new, including our lowest-priced titles.
About this book
This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:
Many classical areas are covered as well as new research topics not included in most existing texts, such as:
This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.
Specifications
PublishedNov 1, 2019
ISBN-100367400154
ISBN-139780367400156
LanguageEnglish
Buying from Saanjhi
- Ships from the USA. Delivery to US addresses only.
- Free delivery on orders over $35.
- 15-day returns. Unless we send the wrong book or it arrives damaged, you pay return shipping and a 15% restocking fee.
- Secure checkout. We never store card details.
Readers who bought this also bought
More from Combinatorics