Faster Parametric Shortest Path and Minimum Balance Algorithms

Neal E. Young, Robert E. Tarjan

ISBN 10: 1332260772 / ISBN 13: 9781332260775

Published by Forgotten Books, 2022

About this Item

Print on Demand. This book approaches two interrelated problems prevalent in network optimization: finding the shortest path and achieving minimum balance. In the first part, the author develops a parametric shortest path algorithm with improved time complexity, enhancing the practicality of this fundamental technique. In the second part, this algorithm is combined with a method for minimum balance, resulting in a faster algorithm for this important problem. The book's insights will be of significant interest to researchers and practitioners working in network optimization, offering both theoretical advancements and practical tools for solving complex network problems more efficiently. 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.

Seller Inventory # 9781332260775_0

Bibliographic Details

• Title: Faster Parametric Shortest Path and Minimum Balance Algorithms
• Publisher: Forgotten Books
• Publication Date: 2022
• Language: English
• ISBN 10: 1332260772
• ISBN 13: 9781332260775
• Binding: Paperback
• Condition: New
• Book Type: print-on-demand item
• Seller catalogs:
  • Calculus

About this title

Synopsis

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 methods
• Strategies for finding pivot paths and updating shortest path trees
• Connections to minimum mean cycle and minimum balancing problems
• Analyses of worst-case and expected running times in practical settings

Ideal for readers of advanced algorithms, this edition clarifies the relationships between core problems and the techniques used to solve them in practice.