Von dem Buch Greedoids haben wir 3 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Bernhard Korte/ Laszlo Lovasz/ Rainer Schrader: Greedoids (ISBN: 9783642634994) in Deutsch.Nur diese Ausgabe anzeigen…
100%: Bernhard Korte, Laszlo Lovasz, Rainer Schrader: Greedoids (Algorithms and Combinatorics, Band 4) (ISBN: 9783540181903) Erstausgabe, in Englisch, Band: 4, Broschiert.Nur diese Ausgabe anzeigen…
100%: Bernhard Korte; Laszlo Lovasz; Rainer Schrader: Greedoids (ISBN: 9783642581915) 1991, in Deutsch, auch als eBook.Nur diese Ausgabe anzeigen…
Alle lieferbaren Bücher - alle Angebote vergleichen
ISBN: 9783642634994
| Preise | 2014 | 2015 | 2016 | 2018 | 2023 |
|---|---|---|---|---|---|
| Schnitt | € 97,97 | € 97,46 | € 122,50 | € 126,09 | € 53,49 |
| Nachfrage |
1
Symbolbild
Greedoids (Algorithms and Combinatorics) (1991)
~EN HC USISBN: 9783540181903 bzw. 3540181903, vermutlich in Englisch, Springer, gebundenes Buch, gebraucht.
Von Händler/Antiquariat, HPB-Dallas [54223947], Dallas, TX, U.S.A.
Item may show signs of shelf wear. Pages may include limited notes and highlighting. May include supplemental or companion materials if applicable. Access codes may or may not work. Connecting readers since 1972. Customer service is our top priority.
Item may show signs of shelf wear. Pages may include limited notes and highlighting. May include supplemental or companion materials if applicable. Access codes may or may not work. Connecting readers since 1972. Customer service is our top priority.
2
Greedoids (1981)
DE NW EBISBN: 9783540181903 bzw. 3540181903, in Deutsch, Springer Berlin Heidelberg, neu, E-Book.
Lieferung aus: Vereinigte Staaten von Amerika, E-Book zum download.
Computers, 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. eBook.
Computers, 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. eBook.
3
Greedoids (Algorithms and Combinatorics) (1991)
EN HC US FEISBN: 9783540181903 bzw. 3540181903, in Englisch, 211 Seiten, Springer, gebundenes Buch, gebraucht, Erstausgabe.
Gebraucht ab: $68.16 (6 Angebote)
Zu den weiteren 6 Angeboten bei Amazon.com
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 24 hours, tatsächliche Versandkosten können abweichen.
Von Händler/Antiquariat, HPB-Dallas.
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the Rado-Hall theorem on transversals is generalized. The self-contained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids. Hardcover, Ausgabe: 1, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1991-10-22, Studio: Springer, Verkaufsrang: 18612022.
Von Händler/Antiquariat, HPB-Dallas.
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the Rado-Hall theorem on transversals is generalized. The self-contained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids. Hardcover, Ausgabe: 1, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1991-10-22, Studio: Springer, Verkaufsrang: 18612022.
4
Greedoids (1991)
DE HC NW RPISBN: 9783642634994 bzw. 3642634990, in Deutsch, Springer Berlin Heidelberg, gebundenes Buch, neu, Nachdruck.
Lieferung aus: Deutschland, Versandkostenfrei, Shipping in 3 days.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
5
Symbolbild
Greedoids (2012)
DE PB USISBN: 9783642634994 bzw. 3642634990, in Deutsch, Springer, Taschenbuch, gebraucht.
Von Händler/Antiquariat, Herb Tandree Philosophy Books [17426], Stroud, UK, United Kingdom.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
6
Greedoids
DE PB NWISBN: 9783642634994 bzw. 3642634990, in Deutsch, Springer, Berlin, Taschenbuch, neu.
Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
buecher.de GmbH & Co. KG, [1].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
7
Greedoids (2012)
DE PB NWISBN: 9783642634994 bzw. 3642634990, in Deutsch, Springer, Taschenbuch, neu.
Lieferung aus: Schweiz, Versandfertig innert 4 - 7 Werktagen.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
8
Greedoids
EN NWISBN: 9783642634994 bzw. 3642634990, in Englisch, Springer, Berlin/Heidelberg/New York, NY, Deutschland, neu.
Lieferung aus: Deutschland, Versandfertig in 2 - 3 Tagen.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
9
Symbolbild
Greedoids
DE NWISBN: 9783642634994 bzw. 3642634990, in Deutsch, Springer, Berlin/Heidelberg/New York, NY, Deutschland, neu.
Von Händler/Antiquariat, Alden Books [58991492], New York, NY, U.S.A.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…