𝔖 Bobbio Scriptorium
✦   LIBER   ✦

R0 bounds for worst-case endemic mixing models

✍ Scribed by Edward H. Kaplan


Book ID
116029647
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
98 KB
Volume
110
Category
Article
ISSN
0025-5564

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


New Worst-Case Upper Bounds for SAT
✍ Edward A. Hirsch πŸ“‚ Article πŸ“… 2000 πŸ› Springer Netherlands 🌐 English βš– 153 KB
Worst Case Bounds for Shortest Path Inte
✍ Cyril Gavoille; Eric GuΓ©vremont πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 285 KB

Consider shortest path inter¨al routing, a popular memory-balanced method for Ž . solving the routing problem on arbitrary networks. Given a network G, let IRS G denote the maximum number of intervals necessary to encode groups of destinations on an edge, minimized over all shortest path interval ro