Path Problems In Networks

de George Theodorakopoulos e John Baras 

eBook
Bertrand.pt - Path Problems In Networks
idioma: Inglês
Editor: Springer International Publishing
Edição: junho de 2022
10%
33,11€
Poupe 3,31€ (10%) Cartão Leitor Bertrand
Disponibilidade Imediata
EBOOK PARA ADOBE DIGITAL EDITIONS (ADE)

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

Da mesma coleção

Continual And Reinforcement Learning For Edge Ai
10%
52,99€ 47,69€
Springer Nature Switzerland
eBook
Network Games
10%
10% Cartão Leitor Bertrand
39,74€
Springer International Publishing
eBook
Path Problems In Networks
ISBN:
9783031799839
Ano de edição:
06-2022
Editor:
Springer International Publishing
Idioma:
Inglês
Páginas:
65
Tipo de Produto:
eBook
Formato:
PDF para ADE i
EAN:
9783031799839
X
O QUE É O CHECKOUT EXPRESSO?

O ‘Checkout Expresso’ utiliza os seus dados habituais (morada e/ou forma de envio, meio de pagamento e dados de faturação) para que a sua compra seja muito mais rápida. Assim, não tem de os indicar de cada vez que fizer uma compra. Em qualquer altura, pode atualizar estes dados na sua ‘Área de Cliente’.

Para que lhe sobre mais tempo para as suas leituras.