Can I read Greedoids (algorithms And Combinatorics) on EtoBox?

Greedoids (algorithms And Combinatorics) by Bernhard Korte, Rainer Schrader, László Lovász (auth.) is a nonfiction available to read on EtoBox.

What is Greedoids (algorithms And Combinatorics) about?

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 ex

Who reads Greedoids (algorithms And Combinatorics)?

Author

Bernhard Korte, Rainer Schrader, László Lovász (auth.)

Publisher

Springer-Verlag Berlin Heidelberg

Published

1991

Language

EN

ISBN

9783642581915

Category

nonfiction

Subjects

Mathematics, Stem