The sparsest additive spanner via multiple weighted BFS trees

The sparsest additive spanner via multiple weighted BFS trees

Content
Grafik
Authors
  • Censor-Hillel, Keren
  • Paz, Ami
  • Ravid, Noam
Grafik Top
Shortfacts
Category
 Journal Paper
Divisions
 Communication Technologies
Theory and Applications of Algorithms
Subjects
 Theoretische Informatik
Journal or Publication Title
 Theoretical Computer Science
ISSN
 0304-3975
Date
 28 May 2020
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.