A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint) - Couverture souple

Ahuja, Ravindra K.

9781332260799: A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint)

Couverture souple

ISBN 10 : 1332260799 ISBN 13 : 9781332260799

Editeur : Forgotten Books, 2018

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

3 Neuf

De EUR 15,56

D�tails de l'�dition

�diteurForgotten Books
Date d'�dition2018
ISBN 10 1332260799
ISBN 13 9781332260799
ReliureBroch�
Langueanglais
Nombre de pages36

Acheter neuf

Afficher cet article

EUR 15,56

Autre devise

Gratuit exp�dition depuis Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9781341791338: A Fast and Simple Algorithm for the Maximum Flow Problem

Edition pr�sent�e

ISBN 10 : 1341791335 ISBN 13 : 9781341791338
Editeur : Palala Press, 2015
Couverture rigide

R�sultats de recherche pour A Fast and Simple Algorithm for the Maximum Flow Problem...

Image fournie par le vendeur

A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint)

Ravindra K. Ahuja, J. B. Orlin

Edit� par Forgotten Books, 2024

ISBN 10 : 1332260799 ISBN 13 : 9781332260799

Neuf Paperback

impression � la demande

Vendeur : Forgotten Books, London, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : New. Print on Demand. This book introduces a groundbreaking algorithm for solving the maximum flow problem in a network, a problem at the heart of network theory with applications in operations research, engineering, and computer science. The author improves upon previous algorithms, including the prevalent Goldberg-Tarjan algorithm, by introducing a novel excess scaling technique. This approach significantly reduces the number of non-saturating pushes, leading to an improved time complexity of O(nm n2 log U), where U represents the upper bound on integral arc capacities. The algorithm becomes particularly efficient when U is polynomially bounded in n, outperforming existing approaches in such scenarios. Unlike complex layered network-based algorithms, this approach leverages distance labels, offering simplicity and ease of implementation. The book also discusses future directions and potential refinements to the algorithm, making it a valuable resource for researchers and practitioners seeking to optimize network flows. 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 9781332260799_0

Contacter le vendeur