Name: Greedoids (Algorithms and Combinatorics, 4) (en Inglés)
Price: 60.09 USD
Availability: InStock
Author: Bernhard Korte; Laszlo Lovasz; Rainer Schrader
ISBN: 9783642634994

portada Greedoids (Algorithms and Combinatorics, 4) (en Inglés)

Greedoids (Algorithms and Combinatorics, 4) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Bernhard Korte; Laszlo Lovasz; Rainer Schrader

Idioma

Inglés

N° páginas

228

Encuadernación

Tapa Blanda

ISBN13

9783642634994

Greedoids (Algorithms and Combinatorics, 4) (en Inglés)

Bernhard Korte; Laszlo Lovasz; Rainer Schrader (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 109.26$ 60.09

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 60.09

Llega entre el 14 Jul y el 27 Jul a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Greedoids (Algorithms and Combinatorics, 4) (en Inglés)"

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.