The digital edition of all books may be viewed on our website before purchase. Excerpt from Faster Parametric Shortest Path and Minimum Balance Algorithms (Classic Reprint)
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. No Jacket. Print on Demand. Explore the math behind fast graph algorithms and their practical uses. This book surveys the parametric shortest path problem and its connections to the minimum mean cycle and minimum balancing problems, offering insights into how these algorithms work together to solve complex network challenges.From foundational ideas to advanced techniques, the text explains how parameterized costs change shortest paths, how pivot paths drive progress, and how potentials help reveal optimal cycles. It also discusses implementation details, running times, and how these methods apply to real-world graphs.How the parametric shortest path problem extends standard shortest path methodsStrategies for finding pivot paths and updating shortest path treesConnections to minimum mean cycle and minimum balancing problemsAnalyses of worst-case and expected running times in practical settingsIdeal for readers of advanced algorithms, this edition clarifies the relationships between core problems and the techniques used to solve them in practice. 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 9781332260775_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332260775
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332260775
Quantité disponible : 15 disponible(s)