Items related to Improved Time Bounds for the Maximum Flow Problem (Classic...

Improved Time Bounds for the Maximum Flow Problem (Classic Reprint) - Softcover

 
9781333734817: Improved Time Bounds for the Maximum Flow Problem (Classic Reprint)

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.

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

Other Popular Editions of the Same Title

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

Featured Edition

ISBN 10:  1332265111 ISBN 13:  9781332265114
Publisher: Forgotten Books, 2018
Softcover

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

Seller Image

Ravindra K. Ahuja, James B. Orlin
Published by Forgotten Books, 2018
ISBN 10: 1333734816 ISBN 13: 9781333734817
New Paperback
Print on Demand

Seller: Forgotten Books, London, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback. Condition: 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. Seller Inventory # 9781333734817_0

Contact seller

Buy New

US$ 17.09
Convert currency
Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Ravindra K. Ahuja
Published by Forgotten Books, 2018
ISBN 10: 1333734816 ISBN 13: 9781333734817
New PAP

Seller: PBShop.store US, Wood Dale, IL, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333734817

Contact seller

Buy New

US$ 21.01
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 15 available

Add to basket

Stock Image

Ravindra K. Ahuja
Published by Forgotten Books, 2018
ISBN 10: 1333734816 ISBN 13: 9781333734817
New PAP

Seller: PBShop.store UK, Fairford, GLOS, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333734817

Contact seller

Buy New

US$ 20.68
Convert currency
Shipping: US$ 4.45
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 15 available

Add to basket