Isbn: 9781332260799 - a fast and simple algorithm for the maximum flow problem (classic reprint) (3 resultados)

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: 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.…