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.
Betaal eenvoudig met kaart, Klarna, Apple Pay of Google Pay. Niet tevreden? Je hebt altijd 14 dagen bedenktijd. Lees meer in onze voorwaarden. Heb je vragen, mail ons dan via hello@memmo.org.
Memmo maakt studeren makkelijker – waar je ook bent ter wereld. Wij brengen je cursusboeken en slimme studietools samen op één plek: samenvattingen, quizzen, podcasts en flashcards. En Ted, je studievriend die antwoord geeft op alles wat je je afvraagt. Meer dan 50.000 studenten studeren hier al – gebouwd om je sneller te laten leren en minder stress te geven.