Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Korte, Bernhard; Vygen, Jens
ISBN 10: 3662560380 ISBN 13: 9783662560389
Editorial: Springer, 2018
Nuevos
Encuadernación de tapa dura
Librería:
Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 25 de marzo de 2015
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
In English. N° de ref. del artículo ria9783662560389_new
Sinopsis:
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 to represent the state of the art of combinatorial optimization.
Acerca del autor:
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Combinatorial Optimization: Theory and ...
Editorial: Springer
Año de publicación: 2018
Encuadernación: Encuadernación de tapa dura
Condición: New
Los mejores resultados en AbeBooks
Imagen de archivo
Combinatorial Optimization: Theory and Algorithms
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G3662560380I5N00
Comprar usado
EUR 58,02
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
hardcover. Condición: Very Good. Nº de ref. del artículo: mon0003865158
Comprar usado
EUR 72,93
EUR 4,25 shipping
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 3 disponibles
Imagen del vendedor
Combinatorial Optimization : Theory and Algorithms
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 30500279
Comprar usado
EUR 77,44
EUR 2,25 shipping
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Combinatorial Optimization
Publicado por
Springer Berlin Heidelberg, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Well-written, popular textbook 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 ref. del artículo: 178843969
Comprar nuevo
EUR 81,44
EUR 48,99 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Combinatorial Optimization | Theory and Algorithms
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Combinatorial Optimization | Theory and Algorithms | Jens Vygen (u. a.) | Buch | XXI | Englisch | 2018 | Springer-Verlag GmbH | EAN 9783662560389 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 111047545
Comprar nuevo
EUR 84,60
EUR 70,00 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen de archivo
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020317372
Comprar nuevo
EUR 93,86
EUR 3,40 shipping
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Combinatorial Optimization : Theory and Algorithms
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 30500279-n
Comprar nuevo
EUR 95,04
EUR 2,25 shipping
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Combinatorial Optimization : Theory and Algorithms
Publicado por
Springer Berlin Heidelberg, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9783662560389
Comprar nuevo
EUR 96,29
EUR 66,16 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Combinatorial Optimization
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2018, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9783662560389
Comprar nuevo
EUR 96,29
EUR 60,00 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Combinatorial Optimization
Publicado por
Springer Berlin Heidelberg Mrz 2018, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9783662560389
Comprar nuevo
EUR 96,29
EUR 23,00 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles