Title
Combinatorial Algorithms (Discrete Mathematics and Its Applications),New
Delivery time: 8-12 business days (International)
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: CombinationsPermutationsGraphsDesignsMany classical areas are covered as well as new research topics not included in most existing texts, such as:Group algorithmsGraph isomorphismHillclimbingHeuristic search algorithmsThis 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.
By changing our most important processes and
products, we have already made a big leap forward. This ranges from the
increased use of more sustainable fibers to the use of more
environmentally friendly printing processes to the development of
efficient waste management in our value chain.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Related Products
You may also like
Frequently Asked Questions
- Q: What topics are covered in 'Combinatorial Algorithms'? A: 'Combinatorial Algorithms' covers various topics including backtracking methods, heuristic search methods, combinations, permutations, graphs, and designs. It also addresses classical areas and new research topics such as group algorithms, graph isomorphism, hill-climbing, and heuristic search algorithms.
- Q: Who is the author of this textbook? A: The textbook is authored by Donald L. Kreher.
- Q: What is the condition of the book? A: The book is in 'New' condition, ensuring that it is free from any wear or damage.
- Q: How many pages does the textbook have? A: 'Combinatorial Algorithms' contains a total of 342 pages, providing a comprehensive overview of the subject.
- Q: What is the binding type of the book? A: The book is bound in hardcover, which offers durability and protection for the pages.
- Q: When was 'Combinatorial Algorithms' published? A: The textbook was published on December 18, 1998.
- Q: Is this book suitable for beginners in combinatorial algorithms? A: Yes, this textbook is designed to be accessible and comprehensible, making it suitable for students of mathematics, electrical engineering, and computer science, even without prior knowledge of combinatorics.
- Q: Does the book include any recent research topics? A: Yes, it includes discussions on recent research topics that are not commonly found in most existing texts, enhancing its value for students and professionals.
- Q: What is the edition of the book? A: This is the first edition of 'Combinatorial Algorithms'.
- Q: Is there a specific audience for this textbook? A: This textbook is aimed at students and professionals in mathematics, electrical engineering, and computer science who are interested in combinatorial algorithms.