Improved Time Bounds for the Maximum Flow Problem (Classic Reprint): December 1987, Revised June 1988: December 1987, Revised June 1988 (Classic Reprint) - Softcover

Ahuja, Ravindra K.

9781332265114: Improved Time Bounds for the Maximum Flow Problem (Classic Reprint): December 1987, Revised June 1988: December 1987, Revised June 1988 (Classic Reprint)

Softcover

ISBN 10: 1332265111 ISBN 13: 9781332265114

Publisher: Forgotten Books, 2018

View all copies of this ISBN edition

1 Used

From � 14.33

3 New

From � 13.32

New insights into fast maximum flow algorithms, with practical ideas for scaling and dynamic trees.

This work surveys improvements in time bounds for the maximum flow problem, focusing on the preflow framework and scaling techniques. It discusses how to move large amounts of flow quickly, and compares approaches that use careful vertex selection, scaling factors, and wave methods. The text also presents how dynamic trees can dramatically speed up computations by moving flow along paths instead of single arcs.

What you’ll experience
- A clear explanation of the preflow algorithm and its key constraints
- Details of scaling variants that aim to reduce total running time
- The use of dynamic trees to accelerate push operations and maintain structure
- Comparisons of different selection rules and their impact on performance

Ideal for readers of advanced algorithms, researchers, and students seeking a rigorous treatment of time bounds in network flow problems.

"synopsis" may belong to another edition of this title.

Publisher: Forgotten Books
Publication date: 2018
Language: English
ISBN 10: 1332265111
ISBN 13: 9781332265114
Binding: Paperback
Number of pages: 36

Search results for Improved Time Bounds for the Maximum Flow Problem (Classic...

Seller Image

Improved Time Bounds for the Maximum Flow Problem: December 1987

Ravindra K. Ahuja, J. B. Orlin

Published by Forgotten Books, 2018

ISBN 10: 1332265111 ISBN 13: 9781332265114

New Paperback

Print on Demand

Seller: Forgotten Books, London, United Kingdom

Seller rating 5 out of 5 stars

Paperback. Condition: New. Print on Demand. This book explores the maximum flow problem, a fundamental challenge in network optimization with applications in diverse fields such as transportation, logistics, and telecommunications. The author delves into various algorithms designed to solve this problem efficiently, tracing their development and comparing their strengths and weaknesses. The book provides a comprehensive overview of the maximum flow problem, from its origins and theoretical foundations to practical implementations and applications. It offers valuable insights into the evolution of algorithmic techniques, highlighting the trade-offs between time complexity, accuracy, and resource utilization. This book is a valuable resource for researchers, practitioners, and students interested in network optimization, graph theory, and algorithms. 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. Seller Inventory # 9781332265114_0

Contact seller