Combinatorial optimization theory algorithms von korte bernhard (14 Ergebnisse)

gebundene Ausgabe. Zustand: Gut. 530 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber und kann entsprechende Merkmale aufweisen (Rückenschild, Instituts-Stempel.). In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 830.

Hardcover. Zustand: New. Sixth Edition 2018. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

paperback. Zustand: Very Good.

Zustand: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Hardcover. Zustand: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 90 KOR 9783540431541 Sprache: Englisch Gewicht in Gramm: 550.…

Zustand: New.

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Combinatorial Optimization | Theory and Algorithms | Bernhard Korte (u. a.) | Taschenbuch | Algorithms and Combinatorics | xxi | Englisch | 2019 | Springer | EAN 9783662585665 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, 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 numerousexercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ )-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.…

Hardcover. Zustand: Brand New. 6th edition. 698 pages. 9.25x6.25x1.75 inches. In Stock.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, 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 numerousexercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ )-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.…

Couverture rigide. Zustand: Très bon. 5ème Édition. Springer, Algorithmes and comnbinatorics (21), 2012. In-8, XIX+659pp. Plein cartonnage de l'éditeur. Fifth edition. Très bon état.