Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Bernhard Korte, Jens Vygen

ISBN 10: 3662585669 ISBN 13: 9783662585665

Editorial: Springer 2019-01-11, 2019

Idioma: Ingl�s

Condici�n: Nuevo Encuadernaci�n de tapa blanda

Guardar para m�s tarde

Vendido por Chiron Media, Wallingford, Reino Unido

Vendedor de AbeBooks desde 2 de agosto de 2010

Calificaci�n del vendedor: 4 de 5 estrellas

Ver los art�culos de este vendedor

Ver todos los ejemplares de este libro

Nuevos - Encuadernaci�n de tapa blanda

Condici�n: Nuevo

Precio: EUR 69,89 Convertir moneda

EUR 17,36 gastos de env�o desde Reino Unido a Espa�a Destinos, gastos y plazos de env�o

Cantidad disponible: 10 disponibles

A�adir al carrito

Guardar para m�s tarde

Descripci�n

N� de ref. del art�culo 6666-IUK-9783662585665

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Editor

Springer 2019-01-11

Fecha de publicaci�n

2019

Idioma

Ingl�s

ISBN 10

3662585669

ISBN 13

9783662585665

Encuadernaci�n

Paperback

Estado

New

Cat�logos de vendedores

Acerca de

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.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

WRAP Ltd
Unit 4, 119 Loverock Rd, Reading, RG30 1DZ, United Kingdom

Condiciones de venta y env�o

Condiciones de venta

TBA

Derecho a cancelaci�n

Condiciones de env�o

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Tarifas de env�o de Reino Unido a Espa�a

Tarifas de env�o de Reino Unido a Espa�a
Cantidad del pedido	De 14 a 21 d�as h�biles	De 14 a 21 d�as h�biles
Primer art�culo	EUR 17.36	EUR 17.36

Los plazos de entrega los establecen los vendedores y var�an seg�n el transportista y la ubicaci�n. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relaci�n con cargos adicionales para cubrir cualquier aumento en los costes de env�o de los art�culos.