The sparsest additive spanner via multiple weighted BFS...

  • Main
  • 2020 / 5
  • The sparsest additive spanner via multiple weighted BFS...
Theoretical Computer Science 2020 / 5

The sparsest additive spanner via multiple weighted BFS trees

Censor-Hillel, Keren, Paz, Ami, Ravid, Noam
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Journal:
Theoretical Computer Science
DOI:
10.1016/j.tcs.2020.05.035
Date:
May, 2020
File:
PDF, 807 KB
2020
Conversion to is in progress
Conversion to is failed