Imagen 1 de 2
Galería
Imagen 1 de 2
¿Quieres vender uno?
Faster Algorithms for the Shortest Path Problem (Classic Reprint)
USD17,40
Aproximadamente14,97 EUR
Estado:
Nuevo
Libro nuevo, sin usar y sin leer, que está en perfecto estado; incluye todas las páginas sin defectos. Consulta el anuncio del vendedor para obtener más información.
- ¡Cómpralo ya!Faster Algorithms for the Shortest Path Problem (Classic Reprint)
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Envío:
Gratis USPS Media MailTM.
Ubicado en: New York NY, Estados Unidos
Entrega:
Entrega prevista entre el vie. 25 jul. y el jue. 31 jul. a 94104
Devoluciones:
30 días para devoluciones. El comprador paga el envío de la devolución..
Pagos:
Compra con confianza
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:135167089939
Última actualización el 30 abr 2025 14:34:01 H.EspVer todas las actualizacionesVer todas las actualizaciones
Características del artículo
- Estado
- Original Language
- English
- Country/Region of Manufacture
- America
- Narrative Type
- Nonfiction
- Intended Audience
- Adults
- Personalize
- No
- Inscribed
- No
- Ex Libris
- No
- Personalized
- No
- Signed
- No
- Type
- textbook
- ISBN
- 9781332260768
Acerca de este producto
Product Identifiers
Publisher
Forgotten Books
ISBN-10
1332260764
ISBN-13
9781332260768
eBay Product ID (ePID)
246365452
Product Key Features
Book Title
Faster Algorithms for the Shortest Path Problem (Classic Reprint)
Number of Pages
48 Pages
Language
English
Publication Year
2015
Topic
General, Calculus
Illustrator
Yes
Genre
Mathematics, History
Format
Trade Paperback
Dimensions
Item Height
0.1 in
Item Weight
2.7 Oz
Item Length
9 in
Item Width
6 in
Additional Product Features
Intended Audience
Trade
Synopsis
Excerpt from Faster Algorithms for the Shortest Path Problem In this paper, we present the fastest known algorithms for the shortest path problem with nonnegative integer arc lengths We consider networks with n nodes and m arcs and in which C represents the largest arc length in the network. Our algorithms are obtained by implementing Dijkstra's algorithm using a new data structure which we call a redistributive heap The one-level redistributive heap consists of O(log C) buckets, each with an associated range of integer numbers Each bucket stores nodes whose temporary distance labels lie in its range Further, the ranges are dynamically changed during the execution, which leads to a redistribution of nodes to buckets. The resulting algorithm runs in O(m + n log C) time. Using a two-level redistributive heap, we improve the complexity of this algorithm to O(m + n log C/ log log nC). Finally, we use a modified version of Fibonacci heaps to reduce the complexity of our algorithm to O(m + n log C ). This algorithm, under the assumption that the largest arc length is bounded by a polynomial function of n, runs in O(m + n log n ) time, which improves over the best previous strongly polynomial bound of O(m + n log n) due to Fredman and Tarjan. We also analyse our algorithms in the semi-logarithmic model of computation. In this model, it takes [log x/log n] time to perform arithmetic on integers of value x. It is shown that in this model of computation, some of our algorithms run in linear time for sufficiently large values of C. 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.", Excerpt from Faster Algorithms for the Shortest Path Problem Surprisingly, these two directions have not been very complementary. The algorithms that achieve the best worst-case complexity have generally not been attractive empirically and the algorithms that have performed well in practice have generally failed to have an attractive worst-case bound. In this paper, we present new implementations of Dijkstra's algorithm intended to bridge this gap. Under the assumption that arc lengths are bounded by a polynomial function of n these algorithms achieve the best possible worst-case complexity for all but very sparse graphs and yet are simple enough to be efficient in practice. 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.
Descripción del artículo del vendedor
Información de vendedor profesional
Acerca de este vendedor
Forgotten Books USA
99,8% de votos positivos•18 mil artículos vendidos
Registrado como vendedor profesional
Votos de vendedor (5.314)
- m***c- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaExcellent seller. Shipping was quick and item was packed properly. The item was described properly and was priced reasonably. Positive from start to finish!
- r***k (2077)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaThe first item was not right. The seller made it right. New item received in great condition. Thank you for the great communication and customer service. It looked exactly like the description and I'm pleased with the value of it. Thanks for producing a quality product that is almost impossible to find now. Most of all, thanks for making it right when it was wrong.The Writings and Speeches of Grover Cleveland (Classic Reprint) (#135167120478)
- b***1 (2372)- Votos emitidos por el comprador.Mes pasadoCompra verificadaItem as described. Fast delivery and well packaged. A 5 star transaction! Highly recommend this seller!!!