{"product_id":"greedoids-9783642634994","title":"Greedoids","description":"\u003cp\u003e • Author(s): Bernhard Korte\u003cbr\u003e • Publisher: Springer\u003cbr\u003e • Publisher Imprint: Springer\u003cbr\u003e • BISAC: Combinatorics\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eOh 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.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Paperback","offer_id":45281787642007,"sku":"9783642634994","price":3672.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9783642634994.webp?v=1769300229","url":"https:\/\/atlanticbooks.com\/products\/greedoids-9783642634994","provider":"Atlantic Books","version":"1.0","type":"link"}