{"product_id":"combinatorial-algorithms-9780367400156","title":"Combinatorial Algorithms","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003e\u003cp\u003eThis textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:\u003c\/p\u003e\u003cli\u003eCombinations\u003cbr\u003e \u003c\/li\u003e\u003cli\u003ePermutations\u003cbr\u003e \u003c\/li\u003e\u003cli\u003eGraphs\u003cbr\u003e \u003c\/li\u003e\u003cli\u003eDesigns\u003cbr\u003e \u003c\/li\u003e\u003cli\u003e \u003cbr\u003eMany classical areas are covered as well as new research topics not included in most existing texts, such as:\u003cbr\u003e \u003c\/li\u003e\u003cli\u003eGroup algorithms\u003cbr\u003e \u003c\/li\u003e\u003cli\u003eGraph isomorphism\u003cbr\u003e \u003c\/li\u003e\u003cli\u003eHill-climbing\u003cbr\u003e \u003c\/li\u003e\u003cli\u003eHeuristic search algorithms\u003cbr\u003e \u003c\/li\u003e\u003cli\u003e \u003cbr\u003eThis 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, \u003cbr\u003e\u003cbr\u003e\u003cb\u003eTrade Review\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e\"Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly...\"\u003cbr\u003e - Dean H. Judson, Ph.D., Nevada State Demographer\u003cbr\u003e\u003cbr\u003e\"…book serves as an introduction to the basic problems and methods…style is clear, transparent…The algorithmic problems are always considered and they are in the center of the discussion…has a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics.\"\u003cbr\u003e - Péter Hajnal, Acta Science Math\u003c\/p\u003e\n\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTable of Contents\u003c\/b\u003e\u003cbr\u003e\u003cp\u003eStructures and Algorithms\u003cbr\u003eWhat are Combinatorial Algorithms?\u003cbr\u003eWhat are Combinatorial Structures?\u003cbr\u003eWhat are Combinatorial Problems?\u003cbr\u003eO-Notation\u003cbr\u003eAnalysis of Algorithms\u003cbr\u003eComplexity Classes\u003cbr\u003eData Structures\u003cbr\u003eAlgorithm Design Techniques\u003cbr\u003eGenerating Elementary Combinatorial Objects\u003cbr\u003eCombinatorial Generation\u003cbr\u003eSubsets\u003cbr\u003ek-Element Subsets\u003cbr\u003ePermutations\u003cbr\u003eMore Topics in Combinatorial Generation\u003cbr\u003eInteger Partitions\u003cbr\u003eSet Partitions, Bell and Stirling Numbers\u003cbr\u003eLabeled Trees\u003cbr\u003eCatalan Families\u003cbr\u003eBacktracking Algorithms\u003cbr\u003eIntroduction\u003cbr\u003eA General Backtrack Algorithm\u003cbr\u003eGenerating All Cliques\u003cbr\u003eEstimating the Size of a Backtrack Tree\u003cbr\u003eExact Cover\u003cbr\u003eBounding Functions\u003cbr\u003eBranch-and-Bound\u003cbr\u003eHeuristic Search\u003cbr\u003eIntroduction to Heuristic Algorithms\u003cbr\u003eDesign Strategies for Heuristic Algorithms\u003cbr\u003eA Steepest-Ascent Algorithm for Uniform Graph Partition\u003cbr\u003eA Hill-Climbing Algorithm for Steiner Triple Systems\u003cbr\u003eTwo Heuristic Algorithms for the Knapsack Problem\u003cbr\u003eA Genetic Algorithm for the Traveling Salesman Problem\u003cbr\u003eGroups and Symmetry\u003cbr\u003eGroups\u003cbr\u003ePermutation Groups\u003cbr\u003eOrbits of Subsets\u003cbr\u003eCoset Representatives\u003cbr\u003eOrbits of k-tuples\u003cbr\u003eGenerating Objects Having Automorphisms\u003cbr\u003eComputing Isomorphism\u003cbr\u003eIntroduction\u003cbr\u003eInvariants\u003cbr\u003eComputing Certificates\u003cbr\u003eIsomorphism of Other Structures\u003cbr\u003eBasis Reduction\u003cbr\u003eIntroduction\u003cbr\u003eTheoretical Development\u003cbr\u003eA Reduced Basis Algorithm\u003cbr\u003eSolving Systems of Integer Equations\u003cbr\u003eThe Merkle-Hellman Knapsack System\u003cbr\u003eBibliography\u003cbr\u003eAlgorithm Index\u003cbr\u003eProblem Index\u003cbr\u003eIndex\u003c\/p\u003e\n\u003c\/li\u003e","brand":"CRC Press","offers":[{"title":"Default Title","offer_id":51017887416663,"sku":"9780367400156","price":61.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0817\/1739\/5799\/files\/9780367400156.jpg?v=1750774995","url":"https:\/\/bookcurl.com\/products\/combinatorial-algorithms-9780367400156","provider":"Book Curl","version":"1.0","type":"link"}