Artículos relacionados a Path Problems in Networks (Synthesis Lectures on Learning,...

Path Problems in Networks (Synthesis Lectures on Learning, Networks, and Algorithms) - Tapa blanda

 
9783031799822: Path Problems in Networks (Synthesis Lectures on Learning, Networks, and Algorithms)
Ver todas las copias de esta edición ISBN.
 
 
  • EditorialSpringer-Verlag GmbH
  • Año de publicación2010
  • ISBN 10 3031799828
  • ISBN 13 9783031799822
  • EncuadernaciónTapa blanda
  • Número de páginas80

Comprar nuevo

Ver este artículo

Gastos de envío: EUR 23,00
De Alemania a Estados Unidos de America

Destinos, gastos y plazos de envío

Añadir al carrito

Los mejores resultados en AbeBooks

Imagen del vendedor

George Theodorakopoulos
ISBN 10: 3031799828 ISBN 13: 9783031799822
Nuevo Taschenbuch Cantidad disponible: 2
Impresión bajo demanda
Librería:
BuchWeltWeit Ludwig Meier e.K.
(Bergisch Gladbach, Alemania)

Descripción Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path problem, and an exposition of a broad range of applications. First of all, the shortest path problem is presented so as to fix terminology and concepts: existence and uniqueness of solutions, robustness to parameter changes, and centralized and distributed computation algorithms. Then, these concepts are generalized to the algebraic context of semirings. Methods for creating new semirings, useful for modeling new problems, are provided. A large part of the book is then devoted to numerous applications of the algebraic path problem, ranging from mobile network routing to BGP routing to social networks. These applications show what kind of problems can be modeled as algebraic path problems; they also serve as examples on how to go about modeling new problems.This monograph will be useful to network researchers, engineers, and graduate students. It can be used either as an introduction to the topic, or as a quick reference to the theoretical facts, algorithms, and application examples. The theoretical background assumed for the reader is that of a graduate or advanced undergraduate student in computer science or engineering. Some familiarity with algebra and algorithms is helpful, but not necessary. Algebra, in particular, is used as a convenient and concise language to describe problems that are essentially combinatorial.Table of Contents: Classical Shortest Path / The Algebraic Path Problem / Properties and Computation of Solutions / Applications / Related Areas / List of Semirings and Applications 80 pp. Englisch. Nº de ref. del artículo: 9783031799822

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 29,95
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor

George Theodorakopoulos
ISBN 10: 3031799828 ISBN 13: 9783031799822
Nuevo Taschenbuch Cantidad disponible: 1
Librería:
AHA-BUCH GmbH
(Einbeck, Alemania)

Descripción Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path problem, and an exposition of a broad range of applications. First of all, the shortest path problem is presented so as to fix terminology and concepts: existence and uniqueness of solutions, robustness to parameter changes, and centralized and distributed computation algorithms. Then, these concepts are generalized to the algebraic context of semirings. Methods for creating new semirings, useful for modeling new problems, are provided. A large part of the book is then devoted to numerous applications of the algebraic path problem, ranging from mobile network routing to BGP routing to social networks. These applications show what kind of problems can be modeled as algebraic path problems; they also serve as examples on how to go about modeling new problems.This monograph will be useful to network researchers, engineers, and graduate students. It can be used either as an introduction to the topic, or as a quick reference to the theoretical facts, algorithms, and application examples. The theoretical background assumed for the reader is that of a graduate or advanced undergraduate student in computer science or engineering. Some familiarity with algebra and algorithms is helpful, but not necessary. Algebra, in particular, is used as a convenient and concise language to describe problems that are essentially combinatorial.Table of Contents: Classical Shortest Path / The Algebraic Path Problem / Properties and Computation of Solutions / Applications / Related Areas / List of Semirings and Applications. Nº de ref. del artículo: 9783031799822

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 33,15
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 32,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor

Baras, John|Theodorakopoulos, George
ISBN 10: 3031799828 ISBN 13: 9783031799822
Nuevo Kartoniert / Broschiert Cantidad disponible: > 20
Impresión bajo demanda
Librería:
moluna
(Greven, Alemania)

Descripción Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appear. Nº de ref. del artículo: 608130062

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 28,42
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío