Greedoids: Algorithms and Combinatorics, cartea 4
Autor Bernhard Korte, Laszlo Lovasz, Rainer Schraderen Limba Engleză Paperback – 18 oct 2012
Din seria Algorithms and Combinatorics
- 18% Preț: 1115.36 lei
- Preț: 384.53 lei
- Preț: 388.74 lei
- 15% Preț: 634.38 lei
- 15% Preț: 653.39 lei
- 18% Preț: 958.22 lei
- 15% Preț: 644.44 lei
- 18% Preț: 775.25 lei
- 18% Preț: 943.97 lei
- 18% Preț: 946.31 lei
- 18% Preț: 891.02 lei
- Preț: 508.43 lei
- 15% Preț: 634.19 lei
- 18% Preț: 891.02 lei
- 24% Preț: 912.87 lei
- 18% Preț: 972.49 lei
- 18% Preț: 960.09 lei
- 20% Preț: 500.19 lei
- 15% Preț: 588.72 lei
- Preț: 396.56 lei
- 15% Preț: 639.42 lei
- 18% Preț: 965.25 lei
- 15% Preț: 584.82 lei
- 15% Preț: 637.78 lei
- 15% Preț: 651.61 lei
- Preț: 378.63 lei
Preț: 383.18 lei
Nou
Puncte Express: 575
Preț estimativ în valută:
73.39€ • 75.61$ • 61.47£
73.39€ • 75.61$ • 61.47£
Carte tipărită la comandă
Livrare economică 24 februarie-10 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642634994
ISBN-10: 3642634990
Pagini: 228
Ilustrații: VIII, 214 p.
Dimensiuni: 170 x 242 x 12 mm
Greutate: 0.37 kg
Ediția:Softcover reprint of the original 1st ed. 1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642634990
Pagini: 228
Ilustrații: VIII, 214 p.
Dimensiuni: 170 x 242 x 12 mm
Greutate: 0.37 kg
Ediția:Softcover reprint of the original 1st ed. 1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
I. Introduction.- 1. Set Systems and Languages.- 2. Graphs, Partially Ordered Sets and Lattices.- II. Abstract Linear Dependence — Matroids.- 1. Matroid Axiomatizations.- 2. Matroids and Optimization.- 3. Operations on Matroids.- 4. Submodular Functions and Polymatroids.- III. Abstract Convexity — Antimatroids.- 1. Convex Geometries and Shelling Processes.- 2. Examples of Antimatroids.- 3. Circuits and Paths.- 4. Helly’s Theorem and Relatives.- 5. Ramsey-type Results.- 6. Representations of Antimatroids.- IV. General Exchange Structures — Greedoids.- 1. Basic Facts.- 2. Examples of Greedoids.- V. Structural Properties.- 1. Rank Function.- 2. Closure Operators.- 3. Rank and Closure Feasibility.- 4. Minors and Extensions.- 5. Interval Greedoids.- VI. Further Structural Properties.- 1. Lattices Associated with Greedoids.- 2. Connectivity in Greedoids.- VII. Local Poset Greedoids.- 1. Polymatroid Greedoids.- 2. Local Properties of Local Poset Greedoids.- 3. Excluded Minors for Local Posets.- 4. Paths in Local Poset Greedoids.- 5. Excluded Minors for Undirected Branchings Greedoids.- VIII. Greedoids on Partially Ordered Sets.- 1. Supermatroids.- 2. Ordered Geometries.- 3. Characterization of Ordered Geometries.- 4. Minimal and Maximal Ordered Geometries.- IX. Intersection, Slimming and Trimming.- 1. Intersections of Greedoids and Antimatroids.- 2. The Meet of a Matroid and an Antimatroid.- 3. Balanced Interval Greedoids.- 4. Exchange Systems and Gauss Greedoids.- X. Transposition Greedoids.- 1. The Transposition Property.- 2. Applications of the Transposition Property.- 3. Simplicial Elimination.- XI. Optimization in Greedoids.- 1. General Objective Functions.- 2. Linear Functions.- 3. Polyhedral Descriptions.- 4. Transversals and Partial Transversals.- 5.Intersection of Supermatroids.- XII. Topological Results for Greedoids.- 1. A Brief Review of Topological Prerequisites.- 2. Shellability of Greedoids and the Partial Tutte Polynomial.- 3. Homotopy Properties of Greedoids.- References.- Notation Index.- Author Index.- Inclusion Chart (inside the back cover).