Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Optimal routing in gossip networks
Yuval Shavitt
*
, Amir Shay
*
Corresponding author for this work
School of Electrical Engineering
Tel Aviv University
Research output
:
Contribution to journal
›
Article
›
peer-review
13
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Optimal routing in gossip networks'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Travellers
100%
Gossip
100%
Optimal Routing
100%
Gossip Networks
100%
Path Cost
60%
Optimal Policy
20%
Dynamic Networks
20%
Shortest Path
20%
Dynamic Programming Algorithm
20%
Network Model
20%
Detour
20%
Stochastic Time
20%
Network Parameters
20%
Grid Network
20%
Routing Policy
20%
Ad Hoc Communication
20%
Dynamic Programming Equation
20%
Computer Science
Optimal Routing
100%
Dynamic Programming
33%
Dynamic Network
33%
Dynamic Programming Algorithm
33%
Gather Information
33%
Network Parameter
33%
Economics, Econometrics and Finance
Dynamic Programming
100%