Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications.
Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications.
Structures and Algorithms What are Combinatorial Algorithms? What are Combinatorial Structures? What are Combinatorial Problems? O-Notation Analysis of Algorithms Complexity Classes Data Structures Algorithm Design Techniques Generating Elementary Combinatorial Objects Combinatorial Generation Subsets k-Element Subsets Permutations More Topics in Combinatorial Generation Integer Partitions Set Partitions, Bell and Stirling Numbers Labeled Trees Catalan Families Backtracking Algorithms Introduction A General Backtrack Algorithm Generating All Cliques Estimating the Size of a Backtrack Tree Exact Cover Bounding Functions Branch-and-Bound Heuristic Search Introduction to Heuristic Algorithms Design Strategies for Heuristic Algorithms A Steepest-Ascent Algorithm for Uniform Graph Partition A Hill-Climbing Algorithm for Steiner Triple Systems Two Heuristic Algorithms for the Knapsack Problem A Genetic Algorithm for the Traveling Salesman Problem Groups and Symmetry Groups Permutation Groups Orbits of Subsets Coset Representatives Orbits of k-tuples Generating Objects Having Automorphisms Computing Isomorphism Introduction Invariants Computing Certificates Isomorphism of Other Structures Basis Reduction Introduction Theoretical Development A Reduced Basis Algorithm Solving Systems of Integer Equations The Merkle-Hellman Knapsack System Bibliography Algorithm Index Problem Index Index
Structures and Algorithms What are Combinatorial Algorithms? What are Combinatorial Structures? What are Combinatorial Problems? O-Notation Analysis of Algorithms Complexity Classes Data Structures Algorithm Design Techniques Generating Elementary Combinatorial Objects Combinatorial Generation Subsets k-Element Subsets Permutations More Topics in Combinatorial Generation Integer Partitions Set Partitions, Bell and Stirling Numbers Labeled Trees Catalan Families Backtracking Algorithms Introduction A General Backtrack Algorithm Generating All Cliques Estimating the Size of a Backtrack Tree Exact Cover Bounding Functions Branch-and-Bound Heuristic Search Introduction to Heuristic Algorithms Design Strategies for Heuristic Algorithms A Steepest-Ascent Algorithm for Uniform Graph Partition A Hill-Climbing Algorithm for Steiner Triple Systems Two Heuristic Algorithms for the Knapsack Problem A Genetic Algorithm for the Traveling Salesman Problem Groups and Symmetry Groups Permutation Groups Orbits of Subsets Coset Representatives Orbits of k-tuples Generating Objects Having Automorphisms Computing Isomorphism Introduction Invariants Computing Certificates Isomorphism of Other Structures Basis Reduction Introduction Theoretical Development A Reduced Basis Algorithm Solving Systems of Integer Equations The Merkle-Hellman Knapsack System Bibliography Algorithm Index Problem Index Index
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826
