Greedoids (Paperback, Softcover reprint of the original 1st ed. 1991)

Oh cieca cupidigia, oh ira folie, Che si ci sproni nella vita corta, E nell' eterna poi si mal c'immolle! o blind greediness and foolish rage, That in our fleeting life so goads us on And plunges us in boiling blood for ever! Dante, The Divine Comedy Inferno, XII, 17, 49/51. On an afternoon hike during the second Oberwolfach conference on Mathematical Programming in January 1981, two of the authors of this book discussed a paper by another two of the authors (Korte and Schrader [1981]) on approximation schemes for optimization problems over independence systems and matroids. They had noticed that in many proofs the hereditary property of independence systems and matroids is not needed: it is not required that every subset of a feasible set is again feasible. A much weaker property is sufficient, namely that every feasible set of cardinality k contains (at least) one feasible subset of cardinality k - 1. We called this property accessibility, and that was the starting point of our investigations on greedoids.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Algorithms and Combinatorics, 4
Release date:	March 2013
First published:	1991
Authors:	Bernhard Korte • Laszlo Lovasz • Rainer Schrader
Dimensions:	242 x 170 x 18mm (L x W x T)
Format:	Paperback
Pages:	214
Edition:	Softcover reprint of the original 1st ed. 1991
ISBN-13:	978-3-642-63499-4
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
LSN:	3-642-63499-0
Barcode:	9783642634994

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!