000 04399nam a22005535i 4500
001 978-3-031-79983-9
003 DE-He213
005 20240730164207.0
007 cr nn 008mamaa
008 220601s2010 sz | s |||| 0|eng d
020 _a9783031799839
_9978-3-031-79983-9
024 7 _a10.1007/978-3-031-79983-9
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
100 1 _aBaras, John.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_982783
245 1 0 _aPath Problems in Networks
_h[electronic resource] /
_cby John Baras, George Theodorakopoulos.
250 _a1st ed. 2010.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2010.
300 _aXII, 65 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _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.
650 0 _aArtificial intelligence.
_93407
650 0 _aCooperating objects (Computer systems).
_96195
650 0 _aProgramming languages (Electronic computers).
_97503
650 0 _aTelecommunication.
_910437
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aCyber-Physical Systems.
_932475
650 2 4 _aProgramming Language.
_939403
650 2 4 _aCommunications Engineering, Networks.
_931570
700 1 _aTheodorakopoulos, George.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_982786
710 2 _aSpringerLink (Online service)
_982788
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031799822
776 0 8 _iPrinted edition:
_z9783031799846
830 0 _aSynthesis Lectures on Learning, Networks, and Algorithms,
_x2690-4314
_982789
856 4 0 _uhttps://doi.org/10.1007/978-3-031-79983-9
912 _aZDB-2-SXSC
942 _cEBK
999 _c85405
_d85405