Ahuja, Ravindra K; Orlin, James B (10 results)

Paperback. Condition: New. International Edition Softcover/Paperback. Satisfaction Guaranteed.

gebundene Ausgabe. Condition: Gut. 846 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann entsprechende Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.). Aufgrund des Alters und der häufigen Nutzung können Stabilität, Einband sowie Papierqualität beeinträchtigt sein. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 1405.

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.

Paperback. Condition: New. Print on Demand. This book introduces a new and improved primal simplex pivot rule for the minimum cost flow problem, demonstrating its worst-case complexity and analyzing its implementation for the shortest path and assignment problems. The author expands on existing research and presents a detailed complexity analysis, providing valuable insights into the potential of this rule. This book positions itself as a significant contribution to the field of network optimization and is essential reading for researchers and practitioners interested in efficient algorithms for network flow problems. Its in-depth exploration of the scaling pivot rule and its applications make it an invaluable resource for advancing the theory and practice of network optimization. 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.

Gebunden. Condition: New.

Paperback. Condition: Brand New. 1st edition. 864 pages. 9.21x6.93x1.85 inches. In Stock.

Paperback. Condition: Brand New. 1st edition. 864 pages. 9.21x6.93x1.85 inches. In Stock.

Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.

Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.

Hardcover. Condition: New. New US Edition Textbook, Ships with Emailed Tracking from USA.