000			04072nam a22004335i 4500
999			_c387821 _d387821
001			387821
003			ES-MaUEC
005			20230328193217.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2010 sz | s |||| 0|eng d
020			_a9783031799839
024	7		_a10.1007/978-3-031-79983-9 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aTK5105.5 _b2010 EB
100	1		_aBaras, John S. _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687842
245	1	0	_aPath Problems in Networks _cby John Baras, George Theodorakopoulos
250			_a1st edition 2010
264		1	_aCham _bSpringer International Publishing _c2010
300			_a1 recurso en línea (XII, 65 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Learning Networks and Algorithms _x2690-4314
505	0		_aClassical Shortest Path -- The Algebraic Path Problem -- Properties and Computation of Solutions -- Applications -- Related Areas -- List of Semirings and Applications.
520			_aThe 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.
988			_aSynthesis Collection of Technology_2010
650		7	_2embne _9141354 _aRedes informáticas _xModelos matemáticos
650		7	_2embne _9146336 _aGrafos, Teoría de
650		7	_2embne _9150657 _aProtocolos de comunicación
700	1		_aTheodorakopoulos, George _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687843
776	0	8	_iPrinted edition: _z9783031799822
776	0	8	_iPrinted edition: _z9783031799846
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-79983-9 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI