Verwandte Artikel zu Faster Parametric Shortest Path and Minimum Balance...

Faster Parametric Shortest Path and Minimum Balance Algorithms (Classic Reprint) - Softcover

 
9781332260775: Faster Parametric Shortest Path and Minimum Balance Algorithms (Classic Reprint)

Inhaltsangabe

Excerpt from Faster Parametric Shortest Path and Minimum Balance Algorithms

The second section describes the minimum mean cycle problem and how the parametric shortest path algorithm can be used to solve it.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Excerpt from Faster Parametric Shortest Path and Minimum Balance Algorithms

The second section describes the minimum mean cycle problem and how the parametric shortest path algorithm can be used to solve it.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

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.

Reseña del editor

Excerpt from Faster Parametric Shortest Path and Minimum Balance Algorithms

We use Fibonacci heaps to improve a parametric shortest path algorithm of Karp and Orlin, and we combine our algorithm and the method of Schneider and Schneider's minimum-balance algorithm to obtain a faster minimum-balance algorithm.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Gratis für den Versand von Vereinigtes Königreich nach USA

Versandziele, Kosten & Dauer

Suchergebnisse für Faster Parametric Shortest Path and Minimum Balance...

Foto des Verkäufers

Neal E. Young, Robert E. Tarjan
Verlag: Forgotten Books, 2018
ISBN 10: 1332260772 ISBN 13: 9781332260775
Neu Paperback
Print-on-Demand

Anbieter: Forgotten Books, London, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: New. 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. print-on-demand item. Bestandsnummer des Verkäufers 9781332260775_0

Verkäufer kontaktieren

Neu kaufen

EUR 14,99
Währung umrechnen
Versand: Gratis
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Neal E. Young
Verlag: Forgotten Books, 2018
ISBN 10: 1332260772 ISBN 13: 9781332260775
Neu PAP

Anbieter: PBShop.store US, Wood Dale, IL, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332260775

Verkäufer kontaktieren

Neu kaufen

EUR 18,59
Währung umrechnen
Versand: Gratis
Innerhalb der USA
Versandziele, Kosten & Dauer

Anzahl: 15 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Neal E. Young
Verlag: Forgotten Books, 2018
ISBN 10: 1332260772 ISBN 13: 9781332260775
Neu PAP

Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332260775

Verkäufer kontaktieren

Neu kaufen

EUR 17,71
Währung umrechnen
Versand: EUR 3,78
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: 15 verfügbar

In den Warenkorb