Synopsis
Explore how modern techniques tighten time bounds for the maximum flow problem, using scaling preflow methods and dynamic trees to accelerate computations.
This compact study surveys key ideas behind efficient maximum flow algorithms. It contrasts the preflow approach with classic augmenting-path methods and shows how scaling and data-structural tools can dramatically affect running times. Readers get a sense of how algorithm design balances theory and practical performance on networks with varying densities and capacities.
- Learn the core ideas behind the preflow algorithm and how valid labeling guides progress.
- See how scaling and dynamic trees contribute to faster flow computations.
- Understand different selection rules and their impact on the number of operations.
- Get a high-level view of how bounds depend on graph size, density, and capacity structure.
Ideal for readers of advanced algorithms and operations research seeking a clear, summarized view of time-bound improvements in maximum flow computation.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Improved Time Bounds for the Maximum Flow Problem (Classic...
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 4 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
Acheter neuf
EUR 15,09
Livraison gratuite
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
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
Acheter neuf
EUR 21,09
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
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 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333734817
Acheter neuf
EUR 20,21
Expédition à EUR 3,78
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 15 disponible(s)