Artículos relacionados a Combinatorial Optimization: Theory and Algorithms:...
Sinopsis
<P>THIS COMPREHENSIVE TEXTBOOK ON COMBINATORIAL OPTIMIZATION PLACES SPECIAL&NBSP;EMPHASIS ON THEORETICAL RESULTS AND ALGORITHMS WITH PROVABLY GOOD&NBSP;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,&NBSP;IT CONTAINS COMPLETE BUT CONCISE PROOFS, AND ALSO PROVIDES NUMEROUS&NBSP;EXERCISES AND REFERENCES. </P><P>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.</P><P></P><P></P><P></P>
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
Biografía 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.
- EditorialSpringer
- Año de publicación2018
- ISBN 10 3662560380
- ISBN 13 9783662560389
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de edición6
- Número de páginas722
Comprar nuevo
Ver este artículo
EUR 97,58
EUR 3,53 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Combinatorial Optimization: Theory and Algorithms:...
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
Cantidad disponible: Más de 20 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
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
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9783662560389
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Combinatorial Optimization : Theory and Algorithms
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 30500279
Gastos de envío:
EUR 17,62
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 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
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen de archivo
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In English. Nº de ref. del artículo: ria9783662560389_new
Gastos de envío:
EUR 14,07
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Combinatorial Optimization : Theory and Algorithms
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 30500279-n
Gastos de envío:
EUR 17,62
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
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: 5 de 5 estrellas
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
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
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
Gastos de envío:
EUR 34,15
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles