Akademibokhandeln
Bernhard Korte, Laszlo Lovasz, Rainer Schrader - Greedoids, Häftad

Häftad, Engelska, 2012

Greedoids

Av Bernhard Korte, Laszlo Lovasz, Rainer Schrader

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Beskrivning
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.
Produktinformation
  • Utgivningsdatum: 2012-10-18
  • Mått: 170 x 242 x 13 mm
  • Vikt: 399 g
  • Format: Häftad
  • Språk: Engelska
  • Serie: Algorithms and Combinatorics
  • Antal sidor: 214
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • ISBN: 9783642634994
Utforska kategorier

Butikslager

Ej i lager i butik.

Betyg & recensioner

0 recensioner

Inga recensioner tillgängliga.