Bernhard Korte is professor of operations research and director of the Research Institute for Discrete Mathematics at the University of Bonn. He founded the Arithmeum in Bonn and received numerous awards, including a honorary doctoral degree and the "Staatspreis NRW". His research interests include combinatorial optimization and chip design.

Jens Vygen is professor of discrete mathematics at the University of Bonn and principal investigator of the Hausdorff Center for Mathematics. He also co-authored the textbook "Algorithmic Mathematics" and has served as editor of several books and journals. His research interests include combinatorial optimization and algorithms for chip design.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteurSpringer-Verlag Berlin and Heidelberg GmbH & Co. K
Date d'�dition2018
ISBN 10 3662560380
ISBN 13 9783662560389
ReliureReli�
Langueanglais
Num�ro d'�dition6
Nombre de pages698
Coordonn�es du fabricantnon disponible

Acheter D'occasion

�tat : Comme neuf

Unread book in perfect condition...

Afficher cet article

EUR 79,81

Autre devise

EUR 17,63 exp�dition depuis Etats-Unis vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 84,15

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783662585665: Combinatorial Optimization: Theory and Algorithms

Edition pr�sent�e

ISBN 10 : 3662585669 ISBN 13 : 9783662585665
Editeur : Springer-Verlag Berlin and Heide..., 2019
Couverture souple

R�sultats de recherche pour combinatorial optimization.: 6th edition

Image fournie par le vendeur

Combinatorial Optimization

Bernhard Korte|Jens Vygen

Edit� par Springer Berlin Heidelberg, 2018

ISBN 10 : 3662560380 ISBN 13 : 9783662560389

Neuf Couverture rigide

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Well-written, popular&nbsptextbook on combinatorial optimization One of very few textbooks on this topic Subject area has manifold applications Offers complete but concise proofs, making it an invaluable practical tool for students . N� de r�f. du vendeur 178843969

Contacter le vendeur

Acheter neuf

EUR 84,15

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Combinatorial Optimization : Theory and Algorithms

Korte, Bernhard; Vygen, Jens

Edit� par Springer, 2018

ISBN 10 : 3662560380 ISBN 13 : 9783662560389

Ancien ou d'occasion Couverture rigide

Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Etat : As New. Unread book in perfect condition. N� de r�f. du vendeur 30500279

Contacter le vendeur

Acheter D'occasion

EUR 79,81

Autre devise

Frais de port : EUR 17,63

De Etats-Unis vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Combinatorial Optimization : Theory and Algorithms

Jens Vygen

Edit� par Springer Berlin Heidelberg, 2018

ISBN 10 : 3662560380 ISBN 13 : 9783662560389

Neuf Couverture rigide

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : 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. N� de r�f. du vendeur 9783662560389

Contacter le vendeur

Acheter neuf

EUR 96,29

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Combinatorial Optimization

Jens Vygen

Edit� par Springer Berlin Heidelberg Mrz 2018, 2018

ISBN 10 : 3662560380 ISBN 13 : 9783662560389

Neuf Couverture rigide

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 to represent the state of the art of combinatorial optimization. 720 pp. Englisch. N� de r�f. du vendeur 9783662560389

Contacter le vendeur

Acheter neuf

EUR 96,29

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Combinatorial Optimization

Jens Vygen

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg M�r 2018, 2018

ISBN 10 : 3662560380 ISBN 13 : 9783662560389

Neuf Couverture rigide

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. Neuware -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 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 720 pp. Englisch. N� de r�f. du vendeur 9783662560389

Contacter le vendeur