Articles liés à Improved Time Bounds for the Maximum Flow Problem (Classic...
Synopsis
This book presents a new approach to improving the efficiency of the maximum flow problem, a cornerstone of network flow theory with wide-ranging applications in computer science, operations research, and other disciplines. The author extends and refines existing preflow algorithms to obtain asymptotically faster running times for the problem. The book offers a detailed analysis of these improved algorithms, showing how they achieve their speedup and providing insights into the behavior of network flow algorithms in general. It concludes by introducing dynamic trees, a sophisticated data structure, into the mix to further enhance efficiency, resulting in the fastest known algorithm for the maximum flow problem at the time of writing.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurForgotten Books
- Date d'édition2024
- ISBN 10 1333734816
- ISBN 13 9781333734817
- ReliureBroché
- Langueanglais
- Nombre de pages27
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 19,13
EUR 1,09 expédition depuis Etats-Unis vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Improved Time Bounds for the Maximum Flow Problem (Classic...
Image d'archives
Improved Time Bounds for the Maximum Flow Problem Classic Reprint
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333734817
Quantité disponible : 15 disponible(s)
Image d'archives
Improved Time Bounds for the Maximum Flow Problem Classic Reprint
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333734817
Quantité disponible : 15 disponible(s)
Image fournie par le vendeur
Improved Time Bounds for the Maximum Flow Problem (Classic Reprint)
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. Print on Demand. This book presents a new approach to improving the efficiency of the maximum flow problem, a cornerstone of network flow theory with wide-ranging applications in computer science, operations research, and other disciplines. The author extends and refines existing preflow algorithms to obtain asymptotically faster running times for the problem. The book offers a detailed analysis of these improved algorithms, showing how they achieve their speedup and providing insights into the behavior of network flow algorithms in general. It concludes by introducing dynamic trees, a sophisticated data structure, into the mix to further enhance efficiency, resulting in the fastest known algorithm for the maximum flow problem at the time of writing. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9781333734817_0
Quantité disponible : Plus de 20 disponibles