text.skipToContent text.skipToNavigation

Combinatorial Optimization von Korte, Bernhard (eBook)

  • Erschienen: 13.01.2012
  • Verlag: Springer, Berlin
eBook (PDF)
67,82 €
inkl. gesetzl. MwSt.
Sofort per Download lieferbar

Online verfügbar

Combinatorial Optimization

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.
This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

Produktinformationen

    Größe: 7633kBytes
    Reihe (Teil): Algorithms and Combinatorics Vol.21
    Herausgeber: Springer, Berlin
    Untertitel: Theory and Algorithms
    Sprache: Englisch
    Seitenanzahl: 664
    Format: PDF
    Kopierschutz: AdobeDRM
    ISBN: 9783642244889
    Ausgabe: 5. Aufl.
    Erschienen: 13.01.2012
Weiterlesen weniger lesen

Kundenbewertungen

    ALDI life eBooks: Die perfekte App zum Lesen von eBooks.

    Hier finden Sie alle Ihre eBooks und viele praktische Lesefunktionen.