Greedoids - Algorithms and Combinatorics 4 (Paperback)
  • Greedoids - Algorithms and Combinatorics 4 (Paperback)

Greedoids - Algorithms and Combinatorics 4 (Paperback)

(author), (author), (author)
Paperback 214 Pages / Published: 18/10/2012
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783642634994
Number of pages: 214
Weight: 401 g
Dimensions: 242 x 170 x 12 mm
Edition: Softcover reprint of the original 1st ed. 199

You may also be interested in...

Proofs from THE BOOK
Added to basket
Proofs and Fundamentals
Added to basket
Introduction to Graph Theory
Added to basket
Discrete Mathematics
Added to basket
Problems in Probability
Added to basket
A Combinatorial Introduction to Topology
Added to basket
Combinatorial Optimization
Added to basket


Please sign in to write a review

Your review has been submitted successfully.