90,30 €*
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
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
Erscheinungsjahr: | 2019 |
---|---|
Fachbereich: | Arithmetik & Algebra |
Genre: | Mathematik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Inhalt: | Einband - flex.(Paperback) |
ISBN-13: | 9780367400156 |
ISBN-10: | 0367400154 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: |
Kreher, Donald L.
Stinson, Douglas R. |
Hersteller: | Taylor & Francis Ltd |
Maße: | 233 x 154 x 22 mm |
Von/Mit: | Donald L. Kreher (u. a.) |
Erscheinungsdatum: | 01.11.2019 |
Gewicht: | 0,517 kg |
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
Erscheinungsjahr: | 2019 |
---|---|
Fachbereich: | Arithmetik & Algebra |
Genre: | Mathematik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Inhalt: | Einband - flex.(Paperback) |
ISBN-13: | 9780367400156 |
ISBN-10: | 0367400154 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: |
Kreher, Donald L.
Stinson, Douglas R. |
Hersteller: | Taylor & Francis Ltd |
Maße: | 233 x 154 x 22 mm |
Von/Mit: | Donald L. Kreher (u. a.) |
Erscheinungsdatum: | 01.11.2019 |
Gewicht: | 0,517 kg |